Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 91A05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 91A43 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6244607 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
algorithmic combinatorial game theory | |||
| Property / zbMATH Keywords: algorithmic combinatorial game theory / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
completeness in polynomial space | |||
| Property / zbMATH Keywords: completeness in polynomial space / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
hardness in fixed parameter computation | |||
| Property / zbMATH Keywords: hardness in fixed parameter computation / rank | |||
Normal rank | |||
Revision as of 15:20, 29 June 2023
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
