, Volume 22, Issue 4, pp 461–478 | Cite as

Error Reduction by Parallel Repetition—A Negative Result

Original Paper

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.


Proof System Error Reduction Parallel Repetition Recent Bound Answer Length 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© János Bolyai Mathematical Society 2002

Authors and Affiliations

  1. 1.Department of Computer Science and Applied MathematicsThe Weizmann InstituteRehovotIsrael
  2. 2.Department of Mechanics and MathematicsLviv UniversityLvivUkraine

Personalised recommendations