Name
Abstract | ||
|---|---|---|
Tiling planar legions 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. |
Year | Venue | Keywords |
|---|---|---|
2013 | ELECTRONIC JOURNAL OF COMBINATORICS | tilings,dominoes,complexity |
DocType | Volume | Issue |
Journal | 20 | 4.0 |
ISSN | Citations | PageRank |
1077-8926 | 5 | 0.50 |
References | Authors | |
13 | 2 | |