Fixed Parameter Analogues of PSpace and k-Move Games
We define parameterized complexity classes that allow us to investigate the complexity of k-move games. We establish a number of concrete hardness and completeness results for games such as the k-move versions of Geography and Chess. We relate these classes to bounded space computations.
KeywordsTuring Machine Conjunctive Normal Form Winning Strategy Boolean Formula Conjunctive Query
- 2.K. Abrahamson, R. Downey, M. Fellows, Fixed-parameter intractability II, in Proceedings of 10th Annual Symposium on Theoretical Aspects on Computer Science, STACS 93, Würzburg, Germany, February 25–27, 1993, ed. by P. Enjalbert, A. Finkel, K. Wagner. LNCS, vol. 665 (Springer, Berlin, 1993), pp. 374–385 Google Scholar
- 67.H. Björklund, S. Sandberg, S. Vorobyov, On fixed-parameter complexity of infinite games, in The Nordic Workshop on Programming Theory (NWPT’03), Åbo Akademi University, Turku, Finland, October 29–31, 2003, ed. by K. Sere, M. Waldén, A. Karlsson (Åbo Akademi, Department of Computer Science, Turku, 2003), pp. 62–64 Google Scholar
- 258.R. Downey, M. Fellows, U. Taylor, The parameterized complexity of relational database queries and an improved characterization of W, in Combinatorics, Complexity & Logic, Proceedings of DMTCS ’96, Singapore, ed. by D. Bridges, C. Calude, J. Gibbons, S. Reeves, I. Witten (Springer, Berlin, 1996), pp. 194–213 Google Scholar
- 312.J. Flum, M. Grohe, Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series (Springer, Berlin, 2006) Google Scholar