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
Latest revision as of 04:14, 1 August 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
0 references
0 references