Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game
type: Item
instance of: scholarly article
title: Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game
zbMATH Open document ID: 1407.68197
author: Angelo Monti
published in: Theoretical Computer Science
publication date: 2014-01-13T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 6244607
zbMATH Keywords: algorithmic combinatorial game theory
zbMATH Keywords: completeness in polynomial space
zbMATH Keywords: hardness in fixed parameter computation
MaRDI profile type: Publication
full work available at URL: j.tcs.2013.10.004
OpenAlex ID: W2085397962
cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
cites work: Q4393480
cites work: Parametrized complexity theory.
cites work: Undirected edge geography
cites work: Q4198056
cites work: Q3395518
cites work: GO Is Polynomial-Space Hard
cites work: On the complexity of some two-person perfect-information games
cites work: Parameterized Chess
cites work: Parameterized pursuit-evasion games
DOI: 10.1016/J.TCS.2013.10.004
description: scientific article; zbMATH DE number 6244607