Three-Player Entangled XOR Games are NP-Hard to Approximate (Q2816299): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2466331000 / rank | |||
Normal rank | |||
Revision as of 23:19, 19 March 2024
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
