Probabilistically checkable proofs with low amortized query complexity

The error probability of Probabilistically Checkable Proof (PCP) systems can be made exponentially small in the number of queries by using sequential repetition. In this paper we are interested in determining the precise rate at which the error goes down in an optimal protocol, and we make substantial progress toward a tight resolution of this question. A PCP verifier uses q~ amortized query bits if, for some t, it makes q~t queries and has error probability at most 2/sup -t/. A PCP characterization of NP using 2.5 amortized query bits is known, and, unless P=NP, no such characterization is possible using 1 amortized query bits. We present a PCP characterization of NP that uses roughly 1.5 amortized query bits. Our result has two main implications. Separating PCP from 2-Provers 1-Round: In the 2-Provers 1-Round (2P1R) model the verifier has access to two oracles (or provers) and can make one query to each oracle. Each answer is a string of l bits (l is called the answer size). A 2P1R protocol with answer size l can be simulated by a PCP that reads 21 bits; we show that the converse does not hold for l/spl ges/7, unless P=NP. No such separation was known before. The Max kCSP problem: The Boolean constraint satisfaction problem with constraints involving at most k variables, usually called Max kCSP, is known to be hard to approximate within a factor 2/sup -4k/, and a 2.2/sup -k/-approximation algorithm is also known. We prove that Max kCSP is NP-hard to approximate within a factor of roughly 2/sup -2k/3/.

[1]  Maria J. Serna,et al.  The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming , 1998, STACS.

[2]  Lars Engebretsen,et al.  Clique Is Hard To Approximate Within , 2000 .

[3]  David P. Williamson,et al.  A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction , 1997, STOC '97.

[4]  Luca Trevisan,et al.  Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

[6]  Nadia Creignou A Dichotomy Theorem for Maximum Generalized Satisfiability Problems , 1995, J. Comput. Syst. Sci..

[7]  Luca TrevisanyAugust Approximating Satissable Satissability Problems , 1997 .

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

[9]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[10]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

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

[13]  Uriel Feige,et al.  Two-Prover Protocols - Low Error at Affordable Rates , 2000, SIAM J. Comput..

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

[15]  Luca Trevisan Approximating Satisfiable Satisfiability Problems , 2000, Algorithmica.

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

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

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

[19]  Luca Trevisan,et al.  Recycling queries in PCPs and in linearity tests (extended abstract) , 1998, STOC '98.

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

[21]  J. Håstad Clique is hard to approximate withinn1−ε , 1999 .

[22]  M. Bellare,et al.  Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.

[23]  Luca Trevisan Approximating Satisfiable Satisfiability Problems (Extended Abstract) , 1997, ESA.

[24]  E. Szemerédi,et al.  O(n LOG n) SORTING NETWORK. , 1983 .

[25]  Luca Trevisan Parallel Approximation Algorithms by Positive Linear Programming , 1998, Algorithmica.

[26]  Carsten Lund,et al.  Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.

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

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

[29]  Uri Zwick,et al.  Finding almost-satisfying assignments , 1998, STOC '98.

[30]  Uri Zwick,et al.  Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.

[31]  Rajeev Motwani,et al.  On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

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

[33]  Johan Håstad,et al.  Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.