Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Reducing uniformity in Khot-Saket hypergraph coloring hardness reductions (1408.0262v4)

Published 1 Aug 2014 in cs.CC

Abstract: In a recent result, Khot and Saket [FOCS 2014] proved the quasi-NP-hardness of coloring a 2-colorable 12-uniform hypergraph with $2{(\log n){\Omega(1)}}$ colors. This result was proved using a novel outer PCP verifier which had a strong soundness guarantee. In this note, we show that we can reduce the arity of their result by modifying their 12-query inner verifier to an 8-query inner verifier based on the hypergraph coloring hardness reductions of Guruswami et. al. [STOC 2014]. More precisely, we prove quasi-NP-hardness of the following problems on n-vertex hypergraphs. - Coloring a 2-colorable 8-uniform hypergraph with $2{(\log n){\Omega(1)}}$ colors. - Coloring a 4-colorable 4-uniform hypergraph with $2{(\log n){\Omega(1)}}$ colors.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (1)
  1. Girish Varma (25 papers)
Citations (12)

Summary

We haven't generated a summary for this paper yet.