Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Elements of information theory
Elements of information theory
On games of incomplete information
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
On the power of multi-prover interactive protocols
Theoretical Computer Science
Direct product results and the GCD problem, in old and new communication models
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Error Reduction by Parallel Repetition—A Negative Result
Combinatorica
Quantum Computation and Quantum Information: 10th Anniversary Edition
Quantum Computation and Quantum Information: 10th Anniversary Edition
On the Randomness of Independent Experiments
IEEE Transactions on Information Theory
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
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
Computational Complexity
New direct-product testers and 2-query PCPs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Bit-probe lower bounds for succinct data structures
Proceedings of the forty-first annual ACM symposium on Theory of computing
Strong Parallel Repetition Theorem for Free Projection Games
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Two-query PCP with subconstant error
Journal of the ACM (JACM)
Parallel repetition of the odd cycle game
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Constructive proofs of concentration bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A K-provers parallel repetition theorem for a version of no-signaling model
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
A Counterexample to Strong Parallel Repetition
SIAM Journal on Computing
Entangled Games Are Hard to Approximate
SIAM Journal on Computing
An efficient parallel repetition theorem
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Almost optimal bounds for direct product threshold theorem
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
On the Composition of Public-Coin Zero-Knowledge Protocols
SIAM Journal on Computing
Spherical cubes: optimal foams from computational hardness amplification
Communications of the ACM
Towards an optimal query efficient PCP?
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Multipartite entanglement in XOR games
Quantum Information & Computation
Derandomized Parallel Repetition Theorems for Free Games
Computational Complexity
Hi-index | 0.02 |
Consider a game where a refereed chooses (x,y) according to a publiclyknown distribution PXY, sends x to Alice, and y to Bob. Withoutcommunicating with each other, Alice responds with a value "a" and Bobresponds with a value "b". Alice and Bob jointly win if a publiclyknown predicate Q(x,y,a,b) holds. Let such a game be given and assume that the maximum probabilitythat Alice and Bob can win is v(n/log(s)), where s is the maximal number of possible responses from Alice and Bob in the initial game, and v' is a constant depending only on v. In this work, we simplify Raz's proof in various ways and thus shorten it significantly. Further we study the case where Alice and Bob are not restricted to local computations and can use any strategy which does not imply communication among them.