Abstract
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Domino problem. In this paper, we prove that the problem remains undecidable if the set of instances is restricted to sets of 5 polyominoes. In the case of tiling by translations only, we prove that the problem is undecidable for sets of 11 polyominoes. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Ollinger, N. (2009). Tiling the plane with a fixed number of polyominoes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5457, pp. 638–647). https://doi.org/10.1007/978-3-642-00982-2_54
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
