Playing disjunctive sums is polynomial space complete
- 1 September 1981
- journal article
- research article
- Published by Springer Nature in International Journal of Game Theory
- Vol. 10 (3) , 195-205
- https://doi.org/10.1007/bf01755964
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- GO Is Polynomial-Space HardJournal of the ACM, 1980
- A Combinatorial Problem Which Is Complete in Polynomial SpaceJournal of the ACM, 1976
- Word problems requiring exponential time(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972