Complexity of tile rotation problems
- 1 November 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 188 (1-2) , 129-159
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On the solvability of domino snake problemsTheoretical Computer Science, 1994
- Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairnessJournal of the ACM, 1986
- On the computational complexity of Ising spin glass modelsJournal of Physics A: General Physics, 1982
- Proving Theorems by Pattern Recognition - IIBell System Technical Journal, 1961