Login / Signup
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes.
Venkatesan Guruswami
Johan Håstad
Prahladh Harsha
Srikanth Srinivasan
Girish Varma
Published in:
CoRR (2013)
Keyphrases
</>
low degree
agnostic learning
uniform distribution
np hard
higher order
threshold functions
np complete
pairwise
membership queries