The complexity of debate checking (Q493647)

From MaRDI portal
Revision as of 18:05, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of debate checking
scientific article

    Statements

    title
    The complexity of debate checking (English)
    0 references
    author
    H. Gökalp Demirci
    0 references
    A. C. Cem Say
    0 references
    Abuzer Yakaryılmaz
    0 references
    publication date
    4 September 2015
    0 references
    zbMATH Keywords
    incomplete information debates
    0 references
    private alternation
    0 references
    games
    0 references
    probabilistic computation
    0 references
    cites work
    Alternation
    0 references
    Q4527018
    0 references
    Q3947125
    0 references
    Q3355236
    0 references
    Q5414546
    0 references
    IP = PSPACE
    0 references
    Q3392275
    0 references
    Quantum Alternation
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q05
    0 references
    68Q10
    0 references
    68Q15
    0 references
    68Q45
    0 references
    zbMATH DE Number
    6478530
    0 references
    OpenAlex ID
    W2080131634
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q493647&oldid=36199187"
    Powered by MediaWiki