The complexity of generalized domino tilings
Combinatorics
2013-05-10 v1 Computational Complexity
Computational Geometry
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.
Cite
@article{arxiv.1305.2154,
title = {The complexity of generalized domino tilings},
author = {Igor Pak and Jed Yang},
journal= {arXiv preprint arXiv:1305.2154},
year = {2013}
}
Comments
17 pages, 16 figures