Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.10.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085397962 / rank | |||
Normal rank | |||
Revision as of 21:07, 19 March 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
