Hardness of finding independent sets in 2-colorable and almost 2-colorable hypergraphs (Q5384079)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7069435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8906782865524292
0 references
0.8455678224563599
0 references
0.8386000990867615
0 references
0.8224771618843079
0 references
