Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149)

From MaRDI portal
Revision as of 15:20, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): conf/stoc/GuruswamiHHSV14, #quickstatements; #temporary_batch_1731505720702)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6451591
  • Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
Language Label Description Also known as
English
Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes
scientific article; zbMATH DE number 6451591
  • Super-polylogarithmic hypergraph coloring hardness via low-degree long codes

Statements

Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (English)
0 references
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes (English)
0 references
0 references
0 references
0 references
0 references
0 references
10 March 2017
0 references
26 June 2015
0 references
hardness of approximation
0 references
hypergraph coloring
0 references
short code
0 references
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references