Complexity limitations on one-turn quantum refereed games (Q6038714)

From MaRDI portal
Revision as of 00:57, 1 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7681313
Language Label Description Also known as
English
Complexity limitations on one-turn quantum refereed games
scientific article; zbMATH DE number 7681313

    Statements

    title
    Complexity limitations on one-turn quantum refereed games (English)
    0 references
    author
    Soumik Ghosh
    0 references
    John Watrous
    0 references
    publication date
    2 May 2023
    0 references
    zbMATH Keywords
    quantum computing
    0 references
    complexity theory
    0 references
    game theory
    0 references
    cites work
    Q4542516
    0 references
    Q4259979
    0 references
    Alternation
    0 references
    Q3522513
    0 references
    Q4527018
    0 references
    Q4359457
    0 references
    STACS 2005
    0 references
    Q3549656
    0 references
    Q4544834
    0 references
    Q2706552
    0 references

    Identifiers

    arXiv ID
    2002.01509
    0 references
    Mathematics Subject Classification ID
    68Qxx
    0 references
    81Pxx
    0 references
    91Axx
    0 references
    zbMATH DE Number
    7681313
    0 references
    OpenAlex ID
    W3005431088
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6038714&oldid=37512740"
    Powered by MediaWiki