Abstract

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].

Citations

617	Information Theory; Coding Theorems for Discrete Memoryless Systems - Csiszar, Körner - 1981
605	Proof Verification and the Hardness of Approximation Problems - Arora, Lund, et al. - 1998
561	Some optimal inapproximability results - Hastad - 2001
536	Communication complexity - Kushilevitz, Nisan - 1997
356	Nondeterministic exponential time has two-prover interactive protocols - Babai, Fortnow, et al. - 1990
335	On the Hardness of Approximating Minimization Problems - Lund, Yannakakis - 1994
319	Probabilistic checking of proofs: a new characterization of NP - Arora, Safra - 1998
194	M.Szegedy. Proof verification and intractability of approximation problems - Arora, Lund, et al. - 1998
191	Free bits, PCPs, and non-approximability — towards tight results - Bellare, Goldreich, et al. - 1998
175	Approximating clique is almost NP-complete - Feige, Goldwasser, et al. - 1991
161	Efficient probabilistically checkable proofs and applications to approximations - Bellare, Goldwasser, et al. - 1993
154	Entropy and Information Theory - Gray - 1990
134	Clique is hard to approximate within n 1−ɛ - H˚astad - 1999
130	The probabilistic communication complexity of set intersection - Kalyanasundaram, Schnitger - 1992
116	On the power of multi-prover interactive protocols - Fortnow, Rompel, et al. - 1994
110	Improved non-approximability results - Bellare, Sudan - 1994
85	Two-prover one-round proof systems: their power and their problems - Feige, Lovász - 1992
67	Clique is hard to approximate within n 1\Gammaffl - Hastad - 1996
58	Hardness of approximations, in Approximation Algorithms for NP-hard - Arora, Lund - 1996
52	The complexity of approximating a nonlinear program - BELLARE, ROGOW, et al. - 1993
45	KILIAN.llvo proverprotocols - Low error at affordable rates.ACM STOC - FEIGE, J - 1994
35	Fully parallelized multi prover protocols for NEXP-time - Lapidot, Shamir - 1991
33	Testing of the long code and hardness for clique - H˚astad - 1996
27	Some optimal inapproximability results - ˚ASTAD - 1997
19	Multi prover interactive proofs: How to remove intractability - Ben-Or, Goldwasser, et al. - 1988
19	Ecient probabilistically checkable proofs and applications to approximation - Bellare, Goldwasser, et al. - 1993
18	Impossibility results for recycling random bits in two-prover proof systems - FEIGE, KILIAN - 1995
17	PSPACE is provable by two provers in one round - Cai, Condon, et al. - 1994
15	Complexity-theoretic aspects of interactive proof systems - Fortnow - 1989
13	Direct product results and the GCD problem, in old and new communication models - Parnafes, Raz, et al. - 1997
12	Probabilistic methods in extremal finite set theory, Extremal Problems for Finite Sets - Alon - 1991
12	On bounded round multi-prover interactive proof systems - Cai, Condon, et al. - 1990
11	Clique is hard to approximate within n 1 - astad - 1996
11	On the distributional complexity of disjointness. Theoretical Computer Science - Razborov - 1992
10	Low communication 2-prover zero-knowledge proofs for np - Dwork, Feige, et al. - 1993
8	Error reduction by parallel repetition — the state of the art. Available on the author’s home - Feige - 1995
8	Two prover protocols { Low error at aordable rates - Feige, Kilian - 1994
7	Interactive Proofs and Approximation - Bellare - 1992
7	On the success probability of the two provers in one round proof systems - Feige - 1991
7	Error Reduction by Parallel Repetition - A Negative Result - Feige, Verbitsky - 2001
7	Towards the parallel repetition conjecture - Verbitsky - 1994
7	On games of incomplete information - Cai, Condon, et al. - 1992
6	Efficient identification schemes using two prover interactive proofs - Ben-Or, Goldwasser, et al. - 1989
5	A one-round, two-prover, zero-knowledge protocol for np - Lapidot, Shamir - 1995
4	On the Success Probability of the Two - Feige - 1991
2	Playing games of incomplete information, Theoret - CAI, CONDON, et al. - 1992
2	astad Testing of the long code and hardness for clique - H - 1996
2	On the maximum density of 0-1 Matrices with no forbidden rectangles - PELEG - 1995
2	Multi-prover encoding schemes and threeprover proof systems - TARDOS - 1994
2	The Parallel Repetition Conjecture for Trees is True, manuscript - VERBITSKY - 1994