On the complexity of some two-person perfect-information games
Author:
- Thomas J. SchaeferTSThomas J. Schaefer
- 1 April 1978
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 16 (2) , 185-225
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- A Combinatorial Problem Which Is Complete in Polynomial SpaceJournal of the ACM, 1976
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975