Provably Difficult Combinatorial Games
- 1 May 1979
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 8 (2) , 151-174
- https://doi.org/10.1137/0208013
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- GO is pspace hardPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Complete problems for deterministic polynomial timeTheoretical 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
- Time bounded random access machinesJournal of Computer and System Sciences, 1973
- A note on disjunctive form tautologiesACM SIGACT News, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- The G-values of various gamesMathematical Proceedings of the Cambridge Philosophical Society, 1956
- Nim, A Game with a Complete Mathematical TheoryAnnals of Mathematics, 1901