On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of monotone dualization and generating minimal hypergraph transversals |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of monotone dualization and generating minimal hypergraph transversals |
scientific article |
Statements
On the complexity of monotone dualization and generating minimal hypergraph transversals (English)
0 references
10 September 2008
0 references
dualization
0 references
hypergraph transversals
0 references
generation algorithms
0 references
monotone Boolean functions
0 references
polynomial space
0 references
0 references
0 references
0 references
0 references
0 references
