Pages that link to "Item:Q396923"
From MaRDI portal
The following pages link to The complexity of generalized domino tilings (Q396923):
Displaying 16 items.
- Fast domino tileability (Q312152) (← links)
- Aspects of a multivariate complexity analysis for rectangle tiling (Q408398) (← links)
- Generalizing the divisibility property of rectangle domino tilings (Q726665) (← links)
- Rectangular tileability and complementary tileability are undecidable (Q740261) (← links)
- On the shuffling algorithm for domino tilings (Q967719) (← links)
- A multiparameter analysis of domino tiling with an application to concurrent systems (Q1193883) (← links)
- On the solvability of domino snake problems (Q1331945) (← links)
- The lattice structure of the set of domino tilings of a polygon (Q1885926) (← links)
- Tile complexity of approximate squares (Q1949754) (← links)
- Flip invariance for domino tilings of three-dimensional regions with two floors (Q2351026) (← links)
- Domino tilings and flips in dimensions 4 and higher (Q2700334) (← links)
- On the connectivity of spaces of three-dimensional domino tilings (Q5036092) (← links)
- Hard tiling problems with simple tiles (Q5955147) (← links)
- Tiling with Squares and Packing Dominos in Polynomial Time (Q6051995) (← links)
- A note on a flip-connected class of generalized domino tilings of the box \([0,2]^n\) (Q6542007) (← links)
- Computational complexity of counting coincidences (Q6614012) (← links)