Construct · 1 fields · 1 citations

parallel repetition theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
parallelrepetition theorem1 CONSTRUCTParallel repetitionRAZ · APPROXIMATION ALGORITHMS

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Approximation algorithms

the result that playing many independent copies of a two-prover game in parallel drives the winning probability down exponentially.

In approximation algorithms, parallel repetition theorem refers to the result that playing many independent copies of a two-prover game in parallel drives the winning probability down exponentially. This meaning comes from Raz (1998) in SIAM Journal on Computing.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how parallel repetition theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

game2 fields · 3 citationsjingle · one word, two constructsparallel1 fields · 1 citationsanchor · a standalone constructrepetition3 fields · 6 citationsjingle · one word, three constructs

References

  1. Raz, R. (1998). A Parallel Repetition Theorem. SIAM Journal on Computing, 27(3), 763-803. https://doi.org/10.1137/s0097539795280895

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct