Sciweavers

2 search results - page 1 / 1
» Parallel repetition: simplifications and the no-signaling ca...
Sort
View
COCOON
2010
Springer
13 years 9 months ago
A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model
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...
Ricky Rosen
STOC
2007
ACM
92views Algorithms» more  STOC 2007»
14 years 5 months ago
Parallel repetition: simplifications and the no-signaling case
: Consider a game where a referee chooses (x,y) according to a publicly known distribution, sends x to Alice, and y to Bob. Without communicating with each other, Alice responds wi...
Thomas Holenstein