7 search results - page 1 / 2 » A Counterexample to Strong Parallel Repetition |
FOCS
2008
IEEE
15 years 20 days ago
2008
IEEE
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)�...
APPROX
2009
Springer
15 years 24 days ago
2009
Springer
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...
ECCC
2010
14 years 6 months ago
2010
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
COCO
2010
Springer
14 years 10 months ago
2010
Springer
—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...
CVPR
2009
IEEE
16 years 1 months ago
2009
IEEE
We present a novel framework for recognizing repetitive
sequential events performed by human actors with strong
temporal dependencies and potential parallel overlap. Our
solutio...