SIAM Journal on Computing
Error Reduction by Parallel Repetition—A Negative Result
Combinatorica
Parallel repetition: simplifications and the no-signaling case
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Understanding Parallel Repetition Requires Understanding Foams
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Parallel repetition in projection games and a concentration bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Unique games on expanding constraint graphs are easy: extended abstract
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Spherical Cubes and Rounding in High Dimensions
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
A Counterexample to Strong Parallel Repetition
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Rounding Parallel Repetitions of Unique Games
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Parallel repetition of entangled games
Proceedings of the forty-third annual ACM symposium on Theory of computing
Derandomized Parallel Repetition Theorems for Free Games
Computational Complexity
| Hi-index | 0.00 |
The parallel repetition theorem states that for any two provers one round game with value at most 1 *** *** (for *** n times in parallel is at most (1 *** *** 3)***(n /logs ) where s is the size of the answers set [Raz98],[Hol07]. For Projection Games the bound on the value of the game repeated n times in parallel was improved to (1 *** *** 2)***(n ) [Rao08] and was shown to be tight [Raz08]. In this paper we show that if the questions are taken according to a product distribution then the value of the repeated game is at most (1 *** *** 2)***(n /logs ) and if in addition the game is a Projection Game we obtain a strong parallel repetition theorem, i.e., a bound of (1 *** *** )***(n ).