Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6244607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game |
scientific article; zbMATH DE number 6244607 |
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
0 references
0.7207511067390442
0 references
0.7207303643226624
0 references
0.7113161683082581
0 references
0.7113158702850342
0 references
