Towards the parallel repetition conjecture

Abstract

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 Hales-Jewett's theorem in Ramsey theory. This allows us to show that the error probability converges to 0 as n/spl rarrspl infin/.<>