A Parallel Repetition Theorem

We show that a parallel repetition of any two-prover one-round proof system (MIP(2,1)) decreases the probability of error at an exponential rate. No constructive bound was previously known. The constant in the exponent (in our analysis) depends only on the original probability of error and on the total number of possible answers of the two provers. The dependency on the total number of possible answers is logarithmic, which was recently proved to be almost the best possible [U. Feige and O. Verbitsky, Proc.11th Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 70--76].

[1]  Richard J. Lipton,et al.  PSPACE is provable by two provers in one round , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[2]  R. Gray.  Entropy and Information Theory , 1990, Springer New York.

[3]  Johan Håstad,et al.  Some optimal inapproximability results , 1997, STOC '97.

[4]  L. Fortnow.  Complexity-Theoretic Aspects of Interactive Proof Systems , 1989 .

[5]  Richard J. Lipton,et al.  On bounded round multiprover interactive proof systems , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[6]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

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

[8]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

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

[10]  Gábor Tardos.  Multi-prover Encoding Schemes and Three-prover Proof Systems , 1996, J. Comput. Syst. Sci..

[11]  Uriel Feige,et al.  Two prover protocols: low error at affordable rates , 1994, STOC '94.

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

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

[14]  Moni Naor,et al.  Low Communication 2-Prover Zero-Knowledge Proofs for NP , 1992, CRYPTO.

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

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

[17]  Oleg Verbitsky.  Towards the Parallel Repetition Conjecture , 1996, Theor. Comput. Sci..

[18]  L. Fortnow,et al.  On the power of multi-power interactive protocols , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[19]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

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

[21]  Uriel Feige,et al.  Impossibility results for recycling random bits in two-prover proof systems , 1995, STOC '95.

[22]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

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

[24]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[25]  David Peleg,et al.  On the maximum density of 0-1 matrices with no forbidden rectangles , 1995, Discret. Math..

[26]  Avi Wigderson,et al.  Efficient Identification Schemes Using Two Prover Interactive Proofs , 1989, CRYPTO.

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

[28]  Uriel Feige.  On the success probability of the two provers in one-round proof systems , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

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

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

[31]  Ran Raz,et al.  Direct product results and the GCD problem, in old and new communication models , 1997, STOC '97.

[32]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

[33]  Richard J. Lipton,et al.  Playing Games of Incomplete Information , 1990, Symposium on Theoretical Aspects of Computer Science.

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

[35]  Mihir Bellare,et al.  The complexity of approximating a nonlinear program , 1995, Math. Program..

[36]  Adi Shamir,et al.  Fully Parallelized Multi-Prover Protocols for NEXP-Time , 1997, J. Comput. Syst. Sci..