Hard Tiling Problems with Simple Tiles

Details Hard Tiling Problems with Simple Tiles Hard Tiling Problems with Simple Tiles

2000-03-06

arxiv.org/abs/math/0003039v1

Mathematics

Combinatorics

Scientific paper

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 simply-connected regions on the four-dimensional hypercubic lattice.

Affiliated with

Also associated with

No associations

Rating

Hard Tiling Problems with Simple Tiles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hard Tiling Problems with Simple Tiles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hard Tiling Problems with Simple Tiles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-346656