volume 26, issue 4, P573-590 2001
DOI: 10.1007/s00454-001-0047-6
View full text
|
|
Share

Abstract: Abstract. It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right tromino alone. In the process, we show that Monotone 1-in-3 Satisfiability is NP-complete for planar cubic graphs. In higher dimensions, we show NP-completeness for the domino and straight tromino for general regions on the cubic lattice, and for simplyconnected regio…

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
43
0
1

Publication Types

Select...

Relationship

0
0

Authors

Journals