The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems)
- 1 January 1984
- book chapter
- Published by Springer Nature
- p. 312-319
- https://doi.org/10.1007/3-540-13331-3_48
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Complexity results for classes of quantificational formulasJournal of Computer and System Sciences, 1980
- Complexity of solvable cases of the decision problem for the predicate calculusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Separating Nondeterministic Time Complexity ClassesJournal of the ACM, 1978
- Undecidability and nonperiodicity for tilings of the planeInventiones Mathematicae, 1971
- The undecidability of the domino problemMemoirs of the American Mathematical Society, 1966
- Turing-machines and the EntscheidungsproblemMathematische Annalen, 1962
- ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASEProceedings of the National Academy of Sciences, 1962
- Proving Theorems by Pattern Recognition - IIBell System Technical Journal, 1961