Probabilistically checkable proofs and their consequences for approximation algorithms

The aim of this paper is to present a self-contained proof of the spectacular recent achievement that NP = PCP (log n, 1). We include, as consequences, results concerning nonapproximability of the clique number, as well as of the chromatic number of graphs, and of MAX-SNP hard problems.

[1]  David S. Johnson,et al.  The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.

[2]  Richard J. Lipton,et al.  New Directions In Testing , 1989, Distributed Computing And Cryptography.

[3]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[4]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[5]  Ronitt Rubinfeld,et al.  Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.

[6]  Ronitt Rubinfeld,et al.  Self-testing polynomial functions efficiently and over rational domains , 1992, SODA '92.

[7]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

[8]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

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

[10]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

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

[12]  Avrim Blum,et al.  Some tools for approximate 3-coloring , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[13]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[14]  Magnús M. Halldórsson,et al.  A Still Better Performance Guarantee for Approximate Graph Coloring , 1993, Information Processing Letters.

[15]  Journal of the Association for Computing Machinery , 1961, Nature.

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

[17]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[18]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[19]  János Komlós,et al.  Deterministic simulation in LOGSPACE , 1987, STOC.

[20]  Magnús M. Hallórsson.  A still better performance guarantee for approximate graph coloring , 1993 .

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

[22]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[23]  Carsten Lund,et al.  Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.

[24]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

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

[26]  László Babai,et al.  E-mail and the unexpected power of interaction , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[27]  Madhu Sudan,et al.  Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems , 1995, Lecture Notes in Computer Science.

[28]  Leonid A. Levin,et al.  Checking computations in polylogarithmic time , 1991, STOC '91.

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

[30]  A. Selman.  Structure in Complexity Theory , 1986, Lecture Notes in Computer Science.

[31]  Carsten Lund,et al.  Proof verification and the intractability of approximation problems , 1992, FOCS 1992.

[32]  Ravi B. Boppana,et al.  Approximating maximum independent sets by excluding subgraphs , 1992, BIT Comput. Sci. Sect..