Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:22, 30 January 2024
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
13 January 2014
0 references
algorithmic combinatorial game theory
0 references
completeness in polynomial space
0 references
hardness in fixed parameter computation
0 references
