The complexity of two-player games of incomplete information
- 31 October 1984
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 29 (2) , 274-301
- https://doi.org/10.1016/0022-0000(84)90034-5
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Computing a perfect strategy for n×n chess requires time exponential in nPublished by Springer Nature ,1981
- AlternationJournal of the ACM, 1981
- GO Is Polynomial-Space HardJournal of the ACM, 1980
- A dynamic logic of multiprocessing with incomplete informationPublished by Association for Computing Machinery (ACM) ,1980
- Provably Difficult Combinatorial GamesSIAM Journal on Computing, 1979
- On the complexity of some two-person perfect-information gamesJournal of Computer and System Sciences, 1978
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965