Super-polylogarithmic hypergraph coloring hardness via low-degree long codes (Q6829111)
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 6451591
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Super-polylogarithmic hypergraph coloring hardness via low-degree long codes |
scientific article; zbMATH DE number 6451591 |
Statements
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes (English)
0 references
26 June 2015
0 references
hardness of approximation
0 references
hypergraph coloring
0 references
short code
0 references
