Error Reduction by Parallel Repetition—A Negative Result

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.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Uriel Feige*.

Additional information

* Incumbent of the Joseph and Celia Reskin Career Development Chair.

† Supported in part by grant No. MQT 300 from the International Science Foundation and by an AMS-FSU grant.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Feige*, U., Verbitsky†, O. Error Reduction by Parallel Repetition—A Negative Result. Combinatorica 22, 461–478 (2002). https://doi.org/10.1007/s00493-002-0001-0

Download citation

Keywords

  • Proof System
  • Error Reduction
  • Parallel Repetition
  • Recent Bound
  • Answer Length