Characterization of Binary Constraint System Games

J. S. Bell. On the Einstein-Podolsky-Rosen paradox. Physics

1964

Earlier work this paper cites.

J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt. Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett

1969

Earlier work this paper cites.

B. S. (Tsirelson) Cirel’son. Quantum generalizations of Bell’s inequality. Lett. in Math. Phys

1980

Earlier work this paper cites.

M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In Proc. of the 20th ACM Symp. on Theory of Computing (STOC 1988)

1988

Earlier work this paper cites.

N. D. Mermin. Simple unified form for the major no-hidden-variables theorems. Phys. Rev. Lett

1990

Earlier work this paper cites.

L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity

1991

Earlier work this paper cites.

N. D. Mermin. Hidden variables and the two theorems of John Bell. Rev. Mod. Phys

1993

Cited alongside, same era.

U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Interactive proofs and the hardness of approximating cliques. J. ACM

1996

Cited alongside, same era.

S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. ACM

1998

Cited alongside, same era.

P. K. Aravind. Bell’s Theorem without inequalities and only two distant observers. Found. Phys. Lett

2002

Cited alongside, same era.

P. K. Aravind. Quantum mysteries revisited again. Am. J. Phys

2004

Cited alongside, same era.

R. Cleve, P. Høyer, B. Toner, J. Watrous. Consequences and limits of nonlocal strategies. In Proc. of the 19th IEEE Conf. on Computational Complexity (CCC 2004)

2004

Later among the works it cites.

P. J. Cameron, A. Montanaro, M. W. Newman, S. Severini, A. Winter. On the quantum chromatic number of a graph. The Electronic Journal of Combinatorics [electronic only]

2007

Later among the works it cites.

F. Speelman. Personal communication, 2011

2011

Later among the works it cites.

A. Arkhipov. Extending and characterizing quantum magic games. arXiv:1209.3819 [quant-ph]

Original

2012

Closest in time.

Z. Ji. Binary constraint system games and locally commutative reductions. arXiv:1310.3794 [quant-ph]

Original

2013

Closest in time.