Pages that link to "Item:Q2349205"
From MaRDI portal
The following pages link to Tiling simply connected regions with rectangles (Q2349205):
Displaying 14 items.
- Fast domino tileability (Q312152) (← links)
- The complexity of generalized domino tilings (Q396923) (← links)
- A PTAS for the square tiling problem (Q476839) (← links)
- Rectangular tileability and complementary tileability are undecidable (Q740261) (← links)
- Tiling figures of the plane with two bars (Q1346250) (← links)
- Tiling with bars and satisfaction of Boolean formulas (Q1922876) (← links)
- \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\) (Q2182309) (← links)
- Small polyomino packing (Q2361496) (← links)
- Complexity of tiling a polygon with trominoes or bars (Q2411829) (← links)
- GENERALIZED DOMINOES TILING'S MARKOV CHAIN MIXES FAST (Q5213496) (← links)
- Hard tiling problems with simple tiles (Q5955147) (← links)
- Tiling with Squares and Packing Dominos in Polynomial Time (Q6051995) (← links)
- Optimal deterministic controller synthesis from steady-state distributions (Q6156635) (← links)
- Computational complexity of counting coincidences (Q6614012) (← links)