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

From MaRDI portal
Revision as of 07:56, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
On the complexity of computing winning strategies for finite poset games
scientific article

    Statements

    On the complexity of computing winning strategies for finite poset games (English)
    0 references
    0 references
    0 references
    23 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    finite games
    0 references
    posets
    0 references
    PSPACE
    0 references
    proof complexity
    0 references