Name
Abstract | ||
|---|---|---|
Does a given set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this problem. However, we present an algorithm for testing whether the complement of a finite region is tileable by a set of rectangles. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.ejc.2014.03.008 | European Journal of Combinatorics |
DocType | Volume | Issue |
Journal | 41 | 1 |
ISSN | Citations | PageRank |
0195-6698 | 2 | 0.37 |
References | Authors | |
19 | 1 | |