Hard tiling problems with simple tiles

Discrete and Computational Geometry

Volumn 26, Issue 4, 2001, Pages 573-590

  Moore, C ^a,b,c   Robson, J M ^d  

^a University of New Mexico   (United States)

^b UNIVERSITY OF NEW MEXICO   (United States)

^c SANTA FE INSTITUTE   (United States)

^d UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035643134     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-001-0047-6     Document Type: Article

References (22)

1. R. Berger, The undecidability of the domino problem. Mem. Amer. Math. Soc. 66 (1966), 1-72.
2. R.M. Robinson, Undecidability and nonperiodicity of tilings of the plane. Invent. Math. 12 (1971), 177-209.
3. H. Lewis, Complexity of solvable cases of the decision problem for predicate calculus. Proc. 19th Symp. Foundations of Computer Science (1978), pp. 35-47.
4. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
5. S.W. Golomb, Polyominoes: Puzzles, Patterns, Problems, and Packings, revised edition. Princeton University Press, Princeton, NJ, 1994.
6. D. Beauquier, M. Nivat, E. Rémila and J.M. Robson, Comput. Geom. 5 (1995), 1-25.
7. C. Kenyon and R. Kenyon, Tiling a polygon with rectangles. Proc. 33rd Symp. Foundations of Computer Science (1992), pp. 610-619.
8. E. Rémila, Tiling a simply connected figure with bars of length 2 and length 3. Discrete Math. 160 (1996), 189-198.
9. E. Rémila, Tilings with bars and satisfaction of Boolean formulas. European J. Combin. 17 (1996), 485-491.
10. C.H. Papadimitriou, Computational Complexity. Addison-Wesley, Reading, MA, 1994.
11. E. Goles and I. Rapaport, Complexity of tile rotation problems. Theoret. Comput. Sci. 188 (1997), 129-159.
12. E. Goles and I. Rapaport, Tiling allowing rotations only. Theoret. Comput. Sci. 218 (1999), 285-295.
13. K. Lindgren, C. Moore and M.G. Nordahl, Complexity of two-dimensional patterns. J. Statist. Phys. 91 (1998), 909-951.
14. L.M. Goldschlager, The monotone and planar circuit value problems are log space complete for P. SIGACT News 9 (1977), 25-29.
15. G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis, Graph Drawing, Prentice Hall, Englewood Cliffs, NJ, 1999.
16. P. Laroche, Planar 1-in-3 satisfiability is NP-complete. ASMICS Workshop on Tilings, Deuxième Journées Polyominos et pavages, Ecole Normale Supérieure de Lyon, 1992.
17. R. Kenyon, Personal communication.
18. A. Verberkmoes and B. Nienhuis, Triangular trimers on the triangular lattice: an exact solution. cond-mat/9904343
19. P.W. Kasteleyn, The statistics of dimers on a lattice, I: The number of dimer arrangements on a quadratic lattice. Physica 27 (1961), 1209-1225.
20. J. Propp, Dimers and dominoes. Manuscript available at http://www-math.mit.edu/~propp/ articles. html.
21. D. Beauquier and M. Nivat, On translating one polyomino to the the plane. Discrete Comput. Geom. 6 (1991), 575-592.
22. K. Keating and A. Vince, Isohedral polyomino tiling of the plane. Discrete Comput. Geom. 21 (1999). 615-630.