Skip to main content
SpringerLink
Log in

Error Reduction by Parallel Repetition—A Negative Result

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science and Applied Mathematics, The Weizmann Institute, Rehovot, 76100, Israel

    Uriel Feige*

  2. Department of Mechanics and Mathematics, Lviv University, 79000, Lviv, Ukraine

    Oleg Verbitsky†

Authors
  1. Uriel Feige*
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oleg Verbitsky†
    View author publications

    You can also search for this author in PubMed Google Scholar

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

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-002-0001-0

Keywords

Search

Navigation