Abstract
Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NP- and #P-completeness) for different generalizations of dominoes in three and higher dimensions.
| Original language | English (US) |
|---|---|
| Journal | Electronic Journal of Combinatorics |
| Volume | 20 |
| Issue number | 4 |
| DOIs | |
| State | Published - Oct 28 2013 |
Keywords
- Complexity
- Dominoes
- Tilings
Fingerprint
Dive into the research topics of 'The complexity of generalized domino tilings'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS