A remark on NP-completeness of picture matching
From MaRDI portal
Publication:1183400
DOI10.1016/0020-0190(91)90022-AzbMath0749.68044MaRDI QIDQ1183400
Shi-Kuo Chang, Maurizio Tucci, Gennaro Costagliola
Publication date: 28 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Computing methodologies for image processing (68U10) Information storage and retrieval of data (68P20)
Related Items (1)
Cites Work
This page was built for publication: A remark on NP-completeness of picture matching