Three-Player Entangled XOR Games are NP-Hard to Approximate (Q2816299): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59792576, #quickstatements; #temporary_batch_1712111774907 |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1302.1242 / rank | |||
Normal rank | |||
Revision as of 08:38, 19 April 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
