Hardness of approximate hypergraph coloring

We introduce the notion of covering complexity of a verifier for probabilistically checkable proofs (PCPs). Such a verifier is given an input, a claimed theorem, and an oracle, representing a purported proof of the theorem. The verifier is also given a random string and decides whether to accept the proof or not, based on the given random string. We define the covering complexity of such a verifier, on a given input, to be the minimum number of proofs needed to "satisfy" the verifier on every random string; i.e., on every random string, at least one of the given proofs must be accepted by the verifier. The covering complexity of PCP verifiers offers a promising route to getting stronger inapproximability results for some minimization problems and, in particular, (hyper)graph coloring problems. We present a PCP verifier for NP statements that queries only four bits and yet has a covering complexity of one for true statements and a superconstant covering complexity for statements not in the language. Moreover, the acceptance predicate of this verifier is a simple not-all-equal check on the four bits it reads. This enables us to prove that, for any constant c, it is NP-hard to color a 2-colorable 4-uniform hypergraph using just c colors and also yields a superconstant inapproximability result under a stronger hardness assumption.

[1]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[2]  Aravind Srinivasan,et al.  Improved bounds and algorithms for hypergraph two-coloring , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[3]  Noga Alon,et al.  Coloring 2-colorable hypergraphs with a sublinear number of colors , 1996 .

[4]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[5]  David R. Karger,et al.  Approximate graph coloring by semidefinite programming , 1998, JACM.

[6]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[7]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[8]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[9]  Jacques Stern,et al.  The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations , 1997, J. Comput. Syst. Sci..

[10]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[11]  Subhash Khot.  Hardness results for approximate hypergraph coloring , 2002, STOC '02.

[12]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[13]  Proof of Lemma 3 , 2022 .

[14]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[15]  Venkatesan Guruswami,et al.  A tight characterization of NP with 3 query PCPs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[16]  Phokion G. Kolaitis.  Hardness Of Approximations , 1996 .

[17]  Lars Engebretsen,et al.  Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT , 1998, Inf. Process. Lett..

[18]  Alan M. Frieze,et al.  Coloring Bipartite Hypergraphs , 1996, IPCO.

[19]  Joel H. Spencer,et al.  Coloring n-Sets Red and Blue , 1981, J. Comb. Theory, Ser. A.

[20]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[21]  Uriel Feige,et al.  Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..

[22]  Venkatesan Guruswami,et al.  On the hardness of 4-coloring a 3-collorable graph , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[23]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[24]  Venkatesan Guruswami,et al.  The Approximability of Set Splitting Problems and Satisfiability Problems with no Mixed Clauses , 1999, Electron. Colloquium Comput. Complex..

[25]  Aravind Srinivasan,et al.  Improved bounds and algorithms for hypergraph 2-coloring , 2000, Random Struct. Algorithms.

[26]  Colin McDiarmid,et al.  A Random Recolouring Method for Graphs and Hypergraphs , 1993, Combinatorics, Probability and Computing.

[27]  Venkatesan Guruswami.  Query-efficient checking of proofs and improved PCP characterizations of NP , 1999 .

[28]  József Beck,et al.  An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.

[29]  Carsten Lund,et al.  Hardness of approximations , 1996 .

[30]  Nathan Linial,et al.  On the Hardness of Approximating the Chromatic Number , 2000, Comb..

[31]  Jonas Holmerin.  Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε , 2002, STOC '02.