Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem

DOI10.1007/978-3-540-79126-3_35zbMath1138.68574OpenAlexW1540286128MaRDI QIDQ5458907

Simone Rinaldi, Christophe Picouleau, Andrea Frosini

Publication date: 24 April 2008

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79126-3_35

zbMATH Keywords

discrete tomographyNP-complete problempolynomial-time reduction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Machine vision and scene understanding (68T45)

Related Items (1)

Regular switching components

This page was built for publication: Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem