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:
Electron. Colloquium Comput. Complex. (2013)
Keyphrases
</>
low degree
agnostic learning
uniform distribution
higher order
threshold functions
computational complexity
np hard
pairwise
np complete
decision lists
learning algorithm
multi class
learning tasks
learning theory
membership queries