Domino-tiling games
- 1 June 1986
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 32 (3) , 374-392
- https://doi.org/10.1016/0022-0000(86)90036-x
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On the computational complexity of satisfiability in propositional logics of programsTheoretical Computer Science, 1982
- Computing a perfect strategy for n × n chess requires time exponential in nJournal of Combinatorial Theory, Series A, 1981
- AlternationJournal of the ACM, 1981
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979
- Relating refined space complexity classesJournal of Computer and System Sciences, 1977
- 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
- Two-Tape Simulation of Multitape Turing MachinesJournal of the ACM, 1966
- The undecidability of the domino problemMemoirs of the American Mathematical Society, 1966