HIROIMONO Is NP-Complete

DOI10.1007/978-3-540-72914-3_5zbMath1201.68055OpenAlexW1959879038MaRDI QIDQ5426013

Daniel Andersson

Publication date: 15 November 2007

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

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

Mathematics Subject Classification ID

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

This page was built for publication: HIROIMONO Is NP-Complete