3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time (Q6040865)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7687743
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7993133664131165
0 references
0.7866169810295105
0 references
0.7841012477874756
0 references
0.7809597253799438
0 references
0.7803503274917603
0 references
