Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980)

From MaRDI portal
Revision as of 06:01, 7 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
Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game
scientific article

    Statements

    Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (English)
    0 references
    0 references
    13 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithmic combinatorial game theory
    0 references
    completeness in polynomial space
    0 references
    hardness in fixed parameter computation
    0 references
    0 references