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.
Author supplied keywords
Cite
CITATION STYLE
APA
Pak, I., & Yang, J. (2013). The complexity of generalized domino tilings. Electronic Journal of Combinatorics, 20(4). https://doi.org/10.37236/2554
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free