PSPACE-hardness of some combinatorial games
- 30 September 1987
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 46 (1) , 21-38
- https://doi.org/10.1016/0097-3165(87)90074-4
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Theory of annihilation games—IJournal of Combinatorial Theory, Series B, 1982
- A complete analysis of Von Neumann's hackendotInternational Journal of Game Theory, 1980
- GO Is Polynomial-Space HardJournal of the ACM, 1980
- Complexity of problems in games, graphs and algebraic equationsDiscrete Applied Mathematics, 1979
- On the complexity of some two-person perfect-information gamesJournal of Computer and System Sciences, 1978
- A Combinatorial Problem Which Is Complete in Polynomial SpaceJournal of the ACM, 1976