The complexity of generalized domino tilings
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.
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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. |
|---|---|
| DOI: | 10.48550/arxiv.1305.2154 |