3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time (Q6040865): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:38, 10 July 2024
scientific article; zbMATH DE number 7687743
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time |
scientific article; zbMATH DE number 7687743 |
Statements
3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time (English)
0 references
22 May 2023
0 references
