3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time (Q6040865)

From MaRDI portal
Revision as of 09:28, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
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
    0 references
    0 references
    22 May 2023
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references