The complexity of generalized domino tilings
classification
🧮 math.CO
cs.CCcs.CG
keywords
dominoesclassicalcomplexitycountingdecisiondifferentdimensionsdomino
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.