Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs (Q5384079)
From MaRDI portal
scientific article; zbMATH DE number 7069435
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs |
scientific article; zbMATH DE number 7069435 |
Statements
Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs (English)
0 references
20 June 2019
0 references
