6 citations · 17 across the 7 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013★ 3 cited
Tiling simply connected regions with rectangles
Igor Pak, Jed Yang
In [BNRR], it was shown that tiling of general regions with two rectangles is NP-complete, except for a few trivial special cases. In a different direction, Rémila showed that for…
math.CO2013★ 6 cited
The complexity of generalized domino tilings
Igor Pak, Jed Yang
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-compl…