On the complexity of computing winning strategies for finite poset games (Q537910)

From MaRDI portal
Revision as of 00:34, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
On the complexity of computing winning strategies for finite poset games
scientific article

    Statements

    title
    On the complexity of computing winning strategies for finite poset games (English)
    0 references
    author
    Michael Soltys
    0 references
    Craig Wilson
    0 references
    publication date
    23 May 2011
    0 references
    zbMATH Keywords
    finite games
    0 references
    posets
    0 references
    PSPACE
    0 references
    proof complexity
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q15
    0 references
    91A05
    0 references
    zbMATH DE Number
    5898929
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q537910&oldid=25639810"
    Powered by MediaWiki