The complexity of generalized domino tilings (Q396923)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6330343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of generalized domino tilings |
scientific article; zbMATH DE number 6330343 |
Statements
The complexity of generalized domino tilings (English)
0 references
14 August 2014
0 references
Summary: Tiling planar regions with dominoes is a classical problem, where 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.
0 references
tilings
0 references
dominoes
0 references
complexity
0 references
0 references
0 references
0 references
0.89286095
0 references
0 references
0.89056224
0 references
0.8893822
0 references
0 references
0.8825911
0 references
0.8825147
0 references
0.8811053
0 references
0.8794038
0 references
