Back to Search
Start Over
NP-completeness of Tiling Finite Simply Connected Regions with a Fixed Set of Wang Tiles
- Publication Year :
- 2024
-
Abstract
- The computational complexity of tiling finite simply connected regions with a fixed set of tiles is studied in this paper. We show that the problem of tiling simply connected regions with a fixed set of $23$ Wang tiles is NP-complete. As a consequence, the problem of tiling simply connected regions with a fixed set of $111$ rectangles is NP-complete. Our results improve that of Igor Pak and Jed Yang by using fewer numbers of tiles. Notably in the case of Wang tiles, the number has decreased by more than one third from $35$ to $23$.
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2405.01017
- Document Type :
- Working Paper