Pulse nav.journalClub Débats actifs Tendances Explorer Questions Chercheurs

Download the App

Join discussions, follow papers, and never miss your next session.

Download on theApp Store

© Synapse Social LLC, 2026

Politique de confidentialité

Accueil Explorer nav.journalClub Tendances

⌘+K

Notice of Retraction: Three-Player Entangled XOR Games Are NP-Hard to Approximate | Synapse

October 1, 2013

Notice of Retraction: Three-Player Entangled XOR Games Are NP-Hard to Approximate

Key Points

Key points are not available for this paper at this time.

Abstract

Retracted.

Like

Bookmark

Share

Cite This Study

Thomas Vidick (Tue,) studied this question.

synapsesocial.com/papers/6a16bcf8b13aec50ea6b772c https://doi.org/https://doi.org/10.1109/focs.2013.87

Like

Bookmark

Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers2012 · 56 citations
2The magic squares and Bell's theorem2002 · 22 citations
3Self-testing/correcting with applications to numerical problems1993 · 722 citations
4The knowledge complexity of interactive proof-systems1985 · 1,249 citations
5Computational Complexity: ADVANCED TOPICS2009 · 583 citations