Clique is hard to approximate within n 1-C

We prove that unless N P = ZP P , Max Clique is hard to approximate in polynomial time within a factor n 1? for any > 0. This is done by, for any > 0, constructing a probabilistically checkable proof for N P which uses amortized free bits.

[1]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  J. Bourgain.  Walsh subspaces of $L^p$-product spaces , 1980 .

[4]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[5]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[6]  Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[7]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[8]  Ravi B. Boppana,et al.  Approximating maximum independent sets by excluding subgraphs , 1990, BIT.

[9]  R. Boppana.  Approximating Maximum Independent Sets by Excluding Subgraphs 1 , 1990 .

[10]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

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

[12]  Piotr Berman,et al.  On the Complexity of Approximating the Independent Set Problem , 1989, Inf. Comput..

[13]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1992, JACM.

[14]  Mihir Bellare,et al.  Improved non-approximability results , 1994, STOC '94.

[15]  Carsten Lund,et al.  Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.

[16]  Lance Fortnow,et al.  On the Power of Multi-Prover Interactive Protocols , 1994, Theor. Comput. Sci..

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

[18]  Uriel Feige,et al.  Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

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

[20]  Mihir Bellare,et al.  Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.

[21]  Johan Håstad.  Testing of the long code and hardness for clique , 1996, STOC '96.

[22]  David Zuckerman,et al.  On Unapproximable Versions of NP-Complete Problems , 1996, SIAM J. Comput..

[23]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.

[24]  U. Feige.  A threshold of ln n for approximating set cover , 1998, JACM.

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

[26]  Mihir Bellare,et al.  Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

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