Geography
- 15 March 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 110 (1) , 197-214
- https://doi.org/10.1016/0304-3975(93)90356-x
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Complexity of path-forming gamesTheoretical Computer Science, 1993
- Prohibiting repetitions makes playing games substantially harderInternational Journal of Game Theory, 1984
- Planar Formulae and Their UsesSIAM Journal on Computing, 1982
- Playing disjunctive sums is polynomial space completeInternational Journal of Game Theory, 1981
- Hex ist PSPACE-vollst ndigActa Informatica, 1981
- GO Is Polynomial-Space HardJournal of the ACM, 1980
- On the complexity of some two-person perfect-information gamesJournal of Computer and System Sciences, 1978
- A Solution of the Shannon Switching GameJournal of the Society for Industrial and Applied Mathematics, 1964