Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): conf/stoc/GuruswamiHHSV14, #quickstatements; #temporary_batch_1731505720702 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: conf/stoc/GuruswamiHHSV14 / rank | |||
Normal rank | |||
Latest revision as of 15:20, 13 November 2024
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 |
|
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
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
