Hex ist PSPACE-vollst ndig
- 1 January 1981
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 15 (2) , 167-191
- https://doi.org/10.1007/bf00288964
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Gobang ist PSPACE-vollständigActa Informatica, 1980
- GO is pspace hardPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- The complexity of checkers on an N × N boardPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- On the complexity of some two-person perfect-information gamesJournal of Computer and System Sciences, 1978
- A combinatorial problem which is complete in polynomial spacePublished by Association for Computing Machinery (ACM) ,1975
- Efficient Planarity TestingJournal of the ACM, 1974
- Word problems requiring exponential time(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1973
- Mathematische Rätsel und ProblemePublished by Springer Nature ,1964