Login / Signup
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes.
Venkatesan Guruswami
Prahladh Harsha
Johan Håstad
Srikanth Srinivasan
Girish Varma
Published in:
STOC (2014)
Keyphrases
</>
low degree
agnostic learning
threshold functions
np hard
uniform distribution
pairwise
higher order
multi class
decision lists
optimal solution
worst case
information theoretic
learning theory
pac learning