Pages that link to "Item:Q1389654"
From MaRDI portal
The following pages link to Complexity of tile rotation problems (Q1389654):
Displaying 9 items.
- The minimum feasible tileset problem (Q666670) (← links)
- Covering by squares (Q924128) (← links)
- Tiling allowing rotations only (Q1292299) (← links)
- A neuro-based optimization algorithm for tiling problems with rotation (Q1857552) (← links)
- Tile complexity of approximate squares (Q1949754) (← links)
- Deterministic twirling with low resources (Q2212925) (← links)
- Edge-Matching Problems with Rotations (Q3088275) (← links)
- Tile Complexity of Linear Assemblies (Q3143302) (← links)
- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions (Q3540099) (← links)