The Community for Technology Leaders
Green Image
Issue No. 05 - May (2017 vol. 50)
ISSN: 0018-9162
pp: 72-79
Zoltan Adam Mann , Budapest University of Technology and Economics
ABSTRACT
References to NP-completeness and NP-hardness are common in the computer science literature, but unfortunately they are often in error or misguided. This article explains the most widespread misconceptions, why they are wrong, and why we should care.
INDEX TERMS
Search problems, Computer science education, NP-hard problem, Algorithm design and analysis, Turing machines, Resource management,combinatorial algorithms, NP-hardness, complexity measures, NP-completeness, history of computing
CITATION
Zoltan Adam Mann, "The Top Eight Misconceptions about NP-Hardness", Computer, vol. 50, no. , pp. 72-79, May 2017, doi:10.1109/MC.2017.146
89 ms
(Ver 3.3 (11022016))