Error reduction by parallel repetition-the state of the art

Authors:
U. Feige
Affiliations:
-
Venue:
Error reduction by parallel repetition-the state of the art
Year:
1995

Citing 0
Cited 4

On the power of unique 2-prover 1-round games

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Entanglement in interactive proof systems with binary answers

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Eliminating cycles in the discrete torus

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Derandomized Parallel Repetition Theorems for Free Games

Computational Complexity

Quantified Score

Hi-index	0.01

Visualization

Abstract

We show that no fixed number of parallel repetitions suffices in order to reduce the error in two-prover one-round proof systems from one constant to another. Our results imply that the recent bounds proven by Ran Raz, showing that the number of rounds that suffice is inversely proportional to the answer length, are nearly best possible. Our proof technique builds upon an idea of Oleg Verbitsky. We use this opportunity to survey the known results on parallel repetition, and to present the proofs of some previously claimed theorems.