Tile-Packing Tomography Is ${\mathbb{NP}}$ -hard

DOI10.1007/978-3-642-14031-0_29zbMath1286.68184OpenAlexW2136139362MaRDI QIDQ3578325

Nguyen Kim Thang, Antoni Lozano, Christoph Dürr, Flavio Guíñez, Marek Chrobak

Publication date: 20 July 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14031-0_29

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Biomedical imaging and signal processing (92C55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Tile-Packing Tomography Is ${\mathbb{NP}}$ -hard