On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:57, 30 January 2024
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
