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:
SIAM J. Comput. (2017)
Keyphrases
</>
low degree
agnostic learning
np hard
higher order
uniform distribution
threshold functions
pairwise
information theoretic
lower bound
upper bound
error rate