Tiling allowing rotations only

Theoretical Computer Science

Volumn 218, Issue 2, 1999, Pages 285-295

  Goles, Eric ^a   Rapaport, Ivan ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038850144     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00327-2     Document Type: Article

References (10)

1. R. Berger, The undecidability of the domino problem, Mem. Amer. Math. Soc. 66 (1966).
2. Y. Etzion-Petruschka, D. Harel, On the solvability of domino snake problems, Theoret. Comput. Sci. 131 (1994) 243-269.
3. E. Goles, I. Rapaport, Complexity of tile rotation problems, Theoret. Comput. Sci. 188 (1997) 129-159.
4. D. Harel, Effective transformations on infinite trees with applications to high undecidability, dominoes and fairness, J. ACM 33 (1986) 224-248.
5. H. Lewis, Complexity of solvable cases of the decision problem for predicate calculus, Proc. 19th Symp. on Foundations of Computer Science, 1978, pp. 35-47.
6. M. Matamala, Complejidad de redes neuronales no lineales y aplicaciones a la optimización, Engineering Thesis, Depto. Ingenieria Matemática, U. de Chile, 1991.
7. R. Robinson, Undecidability and nonperiodicity for tilings of the plane, Invent. Math. 12 (1971) 177-209.
8. m est NP-complet, in: D. Beauquier (Ed.), Actes du Séminaire "Polyominoes et Pavages", Université de Créteil, 1991.
9. P. van Emde Boas, Dominoes are forever, GTI Workshop, Paderborn, 1983, pp. 75-95.
10. H. Wang, Proving theorems by pattern recognition, H. Bell System Tech. J. 40 (1961) 1-41.