Fetching the paper…
Reading the bibliography…
We consider one-round games between a classical referee and two players.
A generalized solution of the orthogonal Procrustes problem
P. H. Schönemann · 1966
Earlier work this paper cites.
On the success probability of two provers in one-round proof systems
U. Feige · 1991
Earlier work this paper cites.
Two-Prover One-Round Proof Systems: Their Power and Their Problems
U. Feige and L. Lovász · 1992
Earlier work this paper cites.
Towards the parallel repetition conjecture
O. Verbitsky · 1994
Earlier work this paper cites.
A parallel repetition theorem
R. Raz · 1998
Earlier work this paper cites.
Two-Prover Protocols—Low Error at Affordable Rates
U. Feige and J. Kilian · 2000
Earlier work this paper cites.
Some optimal inapproximability results
J. Håstad · 2001
Earlier work this paper cites.
Consequences and limits of nonlocal strategies
R. Cleve, P. Høyer, B. Toner, and J. Watrous · 2004
Earlier work this paper cites.
Lecture 12 : ”Confuse / Match” Games ( I ), 2005
R. O’Donnell · 2005
Earlier work this paper cites.
Lecture 13: ”Confuse / Match” Games ( II ), 2005
R. O’Donnell · 2005
Earlier work this paper cites.
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
I. Dinur and O. Reingold · 2006
Cited alongside, same era.
Understanding Parallel Repetition Requires Understanding Foams
U. Feige, G. Kindler, and R. O’Donnell · 2007
Cited alongside, same era.
Parallel repetition: simplifications and no-signaling case
T. Holenstein · 2007
Cited alongside, same era.
Unique games on expanding constraint graphs are easy
S. Arora, S. A. Khot, A. Kolla, D. Steurer, M. Tulsiani, and N. K. Vishnoi · 2008
Cited alongside, same era.
Rounding Parallel Repetitions of Unique Games
B. Barak, M. Hardt, I. Haviv, A. Rao, O. Regev, and D. Steurer · 2008
Cited alongside, same era.
Perfect parallel repetition theorem for quantum XOR proof systems
R. Cleve, W. Slofstra, F. Unger, and S. Upadhyay · 2008
Cited alongside, same era.
Unique Games with Entangled Provers are Easy
J. Kempe, O. Regev, and B. Toner · 2008
Later among the works it cites.
Parallel Repetition in Projection Games and a Concentration Bound
A. Rao · 2008
Later among the works it cites.
A Counterexample to Strong Parallel Repetition
R. Raz · 2008
Later among the works it cites.
Strong Parallel Repetition Theorem for Free Projection Games
B. Barak, A. Rao, R. Raz, R. Rosen, and R. Shaltiel · 2009
Later among the works it cites.
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies
T. Ito, H. Kobayashi, and K. Matsumoto · 2009
Later among the works it cites.
New direct-product testers and 2-query PCPs
R. Impagliazzo, V. Kabanets, and A. Wigderson · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Locally Testing Direct Product in the Low Error Range
I. Dinur and E. Goldenberg · 2008
Cited alongside, same era.
Uniform direct product theorems: simplified, optimized, and derandomized
R. Impagliazzo · 2008
Cited alongside, same era.
Entangled Games are Hard to Approximate
J. Kempe, H. Kobayashi, K. Matsumoto, B. Toner, and T. Vidick · 2008
Cited alongside, same era.
Derandomized Parallel Repetition of Structured PCPs
I. Dinur and O. Meir · 2010
Closest in time.
No Strong Parallel Repetition with Entangled and Non-signaling Provers
J. Kempe and O. Regev · 2010
Closest in time.
A Strong Parallel Repetition Theorem for Projection Games on Expanders
R. Raz and R. Rosen · 2010
Closest in time.