Journal of the ACM Bibliography
David Lichtenstein and Michael Sipser. GO is
polynomial-space hard. Journal of the ACM, 27(2):393-401,
April 1980.
[BibTeX entry]
Selected papers that cite this one
- Daphne Koller, Nimrod Megiddo, and Bernhard von Stengel. Fast algorithms for
finding randomized strategies in game trees. In Proceedings of
the Twenty-Sixth Annual ACM Symposium on the Theory of Computing,
pages 750-759, Montréal, Québec, Canada, 23-25 May 1994.
- J. M. Robson. Alternation
with restrictions on looping. Information and Control,
67(1-3):2-11, October/November/December 1985.
- Akio Yanbe and Kouichi Sakurai. A short certificate of the
number of universal optimal strategies for stopping simple stochastic
games. Information Processing Letters, 57(1):17-24, 15
January 1996.
Shortcuts: