A note on reducing uniformity in Khot-Saket hypergraph coloring hardness reductions

@article{Varma2016ANO,
  title={A note on reducing uniformity in Khot-Saket hypergraph coloring hardness reductions},
  author={Girish Varma},
  journal={Chicago J. Theor. Comput. Sci.},
  year={2016},
  volume={2016}
}
  • Girish Varma
  • Published 2016 in Chicago J. Theor. Comput. Sci.
In a recent result, Khot and Saket [FOCS 2014] proved the quasi-NP-hardness of coloring a 2-colorable 12-uniform hypergraph with 2(logn) Ω(1) colors. This result was proved using a novel outer PCP verifier which had a strong soundness guarantee. We reduce the arity in their result by modifying their 12-query inner verifier to an 8-query inner verifier based… CONTINUE READING