Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154): Difference between revisions
From MaRDI portal
Latest revision as of 13:35, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors |
scientific article |
Statements
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (English)
0 references
10 March 2017
0 references
inapproximability
0 references
hypergraph coloring
0 references
PCP
0 references
