TY - GEN

T1 - Parallel repetition of two prover games

AU - Raz, Ran

PY - 2010/8/10

Y1 - 2010/8/10

N2 - The parallel repetition theorem states that for any two-prover game with value smaller than 1, parallel repetition reduces the value of the game in an exponential rate. We give a short introduction to the problem of parallel repetition of two-prover games and some of its applications in theoretical computer science, mathematics and physics. We will concentrate mainly on recent results.

AB - The parallel repetition theorem states that for any two-prover game with value smaller than 1, parallel repetition reduces the value of the game in an exponential rate. We give a short introduction to the problem of parallel repetition of two-prover games and some of its applications in theoretical computer science, mathematics and physics. We will concentrate mainly on recent results.

UR - http://www.scopus.com/inward/record.url?scp=77955254155&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955254155&partnerID=8YFLogxK

U2 - 10.1109/CCC.2010.9

DO - 10.1109/CCC.2010.9

M3 - Conference contribution

AN - SCOPUS:77955254155

SN - 9780769540603

T3 - Proceedings of the Annual IEEE Conference on Computational Complexity

SP - 3

EP - 6

BT - Proceedings - 25th Annual IEEE Conference on Computational Complexity, CCC 2010

T2 - 25th Annual IEEE Conference on Computational Complexity, CCC 2010

Y2 - 9 June 2010 through 11 June 2010

ER -