Playing disjunctive sums is polynomial space complete
International Journal of Game Theory1981Vol. 10(3-4), pp. 195–205
Citations Over Time
Related Papers
- → Gobang ist PSPACE-vollst�ndig(1980)54 cited
- → PSPACE-hardness of some combinatorial games(1987)29 cited
- → Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games(2015)6 cited
- → Structure in complexity theory : proceedings of the conference held at the University of California, Berkeley, California, June 2-5, 1986(1986)1 cited
- An Ergodic Theorem for PSPACE functions.(2020)