Complexity of tile rotation problems

DOI10.1016/S0304-3975(96)00291-5MaRDI QIDQ1389654zbMATH OpenOpenAlexFDO

Authors Eric Goles, Ivan Rapaport

Publication date 30 June 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(96)00291-5

zbMATH Keywords

tile rotation problems

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Tiling allowing rotations only
• Hard tiling problems with simple tiles
• Edge-matching problems with rotations
• Complexity of tiling a polygon with trominoes or bars
• The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions

Cites work

• scientific article; zbMATH DE number 3566230 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the solvability of domino snake problems

Cited in

(8)

• Tiling allowing rotations only
• A neuro-based optimization algorithm for tiling problems with rotation
• Tile complexity of approximate squares
• Deterministic twirling with low resources
• Edge-matching problems with rotations
• Tile Complexity of Linear Assemblies
• The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions
• Covering by squares

This page was built for publication: Complexity of tile rotation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389654)