Error Reduction by Parallel Repetition—A Negative Result
- 125 Downloads
We show that no ﬁxed number of parallel repetitions suﬃces 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.
KeywordsProof System Error Reduction Parallel Repetition Recent Bound Answer Length
Unable to display preview. Download preview PDF.