—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
In a two player game, a referee asks two cooperating players (who are not allowed to communicate) questions sampled from some distribution and decides whether they win or not base...
The parallel repetition theorem states that for any two-prover game, with value 1 − (for, say, ≤ 1/2), the value of the game repeated in parallel n times is at most (1 − c)...
We show that the NP-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...