Fetching the paper…
Reading the bibliography…
XOR games are a simple computational model with connections to many areas of complexity theory.
On bounded bilinear forms in an infinite number of variables
J. E. Littlewood · 1930
Earlier work this paper cites.
Nuclear locally convex spaces
A. Pietsch · 1972
Earlier work this paper cites.
Quotient algebras of uniform algebras
A. Davie · 1973
Earlier work this paper cites.
A theorem on operator algebras
N. Varopoulos · 1975
Earlier work this paper cites.
On the best constants in the Khinchin inequality
S. J. Szarek · 1976
Earlier work this paper cites.
The von Neumann inequality for polynomials in several Hilbert-Schmidt operators
A. Tonge · 1978
Earlier work this paper cites.
Multidimensional extensions of the Grothendieck inequality and applications
R. C. Blei · 1979
Earlier work this paper cites.
Banach Lattices and Extensions of Grothendieck’s Inequality
T. K. Carne · 1980
Earlier work this paper cites.
The best constants in the khintchine inequality
U. Haagerup · 1982
Earlier work this paper cites.
A simple and elementary proof of the Kchintchine inequality with the best constant
B. Tomaszewski · 1987
Earlier work this paper cites.
Extreme quantum entanglement in a superposition of macroscopically distinct states
N. D. Mermin · 1990
Earlier work this paper cites.
Multiparty protocols, pseudorandom generators for Logspace, and time-space trade-offs
L. Babai, N. Nisan, and M. Szegedy · 1992
Earlier work this paper cites.
Some results and problems on quantum Bell-type inequalities
B. S. Tsirelson · 1993
Cited alongside, same era.
Bell theorem involving all settings of measuring apparatus
M. Zukowski · 1993
Cited alongside, same era.
Absolutely summing operators
J. Diestel, H. Jarchow, and A. Tonge · 1995
Cited alongside, same era.
The Schatten space S 4 S_{4} is a Q-algebra
C. Le Merdy · 1998
Cited alongside, same era.
A parallel repetition theorem
R. Raz · 1998
Cited alongside, same era.
Complexifications of real banach spaces, polynomials and multilinear maps
G. A. Munoz, Y. Sarantopoulos, and A. Tonge · 1999
Cited alongside, same era.
The trace class is a Q-algebra
D. Pérez-García · 2006
Later among the works it cites.
Parallel repetition: simplifications and no-signaling case
T. Holenstein · 2007
Later among the works it cites.
Lower bounds for quantum communication complexity
H. Klauck · 2007
Later among the works it cites.
Lower bounds in communication complexity based on factorization norms
N. Linial and A. Shraibman · 2007
Later among the works it cites.
Multiparty communication complexity of disjointness
A. Chattopadhyay and A. Ada · 2008
Later among the works it cites.
Perfect parallel repetition theorem for quantum xor proof systems
R. Cleve, W. Slofstra, F. Unger, and S. Upadhyay · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Some optimal inapproximability results
J. Håstad · 2001
Cited alongside, same era.
Quantum communication complexity of symmetric predicates
A. Razborov · 2003
Cited alongside, same era.
Consequences and limits of nonlocal strategies
R. Cleve, P. Høyer, B. Toner, and J. Watrous · 2004
Cited alongside, same era.
On the advantage over a random assignment
J. Håstad and S. Venkatesh · 2004
Cited alongside, same era.
Approximating the cut-norm via Grothendieck’s inequality
N. Alon and A. Naor · 2006
Cited alongside, same era.
GHZ extraction yield for multipartite stabilizer states
S. Bravyi, D. Fattal, and D. Gottesman · 2006
Cited alongside, same era.
Linear equations modulo two and the L 1 L_{1} diameter of convex bodies
S. Khot and A. Naor · 2008
Later among the works it cites.
Unbounded violation of tripartite bell inequalities
D. Pérez-García, M. M. Wolf, C. Palazuelos, I. Villanueva, and M. Junge · 2008
Later among the works it cites.
The pattern matrix method for lower bounds on quantum communication
A. Sherstov · 2008
Later among the works it cites.
Disjointness is hard in the multiparty number-on-the-forehead model
T. Lee and A. Shraibman · 2009
Closest in time.
Lower bounds on quantum multiparty communication complexity
T. Lee, G. Schechtman, and A. Shraibman · 2009
Closest in time.
A probabilistic inequality with applications to threshold direct-product theorems
F. Unger · 2009
Closest in time.