Three-Player Entangled XOR Games are NP-Hard to Approximate (Q2816299)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three-Player Entangled XOR Games are NP-Hard to Approximate |
scientific article |
Statements
Three-Player Entangled XOR Games are NP-Hard to Approximate (English)
0 references
4 July 2016
0 references
PCP theorem
0 references
XOR games
0 references
entangled games
0 references
Bell inequalities
0 references
0 references
