Sign in

Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes.

Venkatesan GuruswamiPrahladh HarshaJohan HåstadSrikanth SrinivasanGirish 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