Edge-Matching Problems with Rotations

DOI10.1007/978-3-642-22953-4_10zbMath1342.68161arXiv1703.09421OpenAlexW7858725WikidataQ57200620 ScholiaQ57200620MaRDI QIDQ3088275

Carsten Witt, Paul Fischer, Martin Ebbesen

Publication date: 19 August 2011

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.09421

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of tile rotation problems
• Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
• An Eulerian exposition
• Approximability of Edge Matching Puzzles
• An Eulerian path approach to DNA fragment assembly
• The complexity of satisfiability problems

This page was built for publication: Edge-Matching Problems with Rotations