We consider the behavior of the error probability of a two-prover one-round interactive protocol repeated n times in parallel. We point out the connection of this problem with the density form of the Hales-Jewett theorem in Ramsey theory. This allows us to show that the error probability converges to 0 as n → ∞.
CITATION STYLE
Verbitsky, O. (1996). Towards the parallel repetition conjecture. Theoretical Computer Science, 157(2), 277–282. https://doi.org/10.1016/0304-3975(95)00165-4
Mendeley helps you to discover research relevant for your work.