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

DOI10.1016/J.TCS.2013.10.004zbMath1407.68197OpenAlexW2085397962MaRDI QIDQ391980

Angelo Monti

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.10.004

zbMATH Keywords

algorithmic combinatorial game theorycompleteness in polynomial spacehardness in fixed parameter computation

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On variants of vertex geography on undirected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parameterized pursuit-evasion games
• Undirected edge geography
• On the complexity of some two-person perfect-information games
• Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues]
• Parametrized complexity theory.
• Parameterized Chess
• GO Is Polynomial-Space Hard

This page was built for publication: Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game