Three-player entangled XOR games are NP-hard to approximate (Q2816299)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Three-player entangled XOR games are NP-hard to approximate |
scientific article; zbMATH DE number 6600660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three-player entangled XOR games are NP-hard to approximate |
scientific article; zbMATH DE number 6600660 |
Statements
4 July 2016
0 references
PCP theorem
0 references
XOR games
0 references
entangled games
0 references
Bell inequalities
0 references
0 references
Three-player entangled XOR games are NP-hard to approximate (English)
0 references
0.8865613341331482
0 references
0.8201290369033813
0 references
0.8150888085365295
0 references
0.8124027848243713
0 references
