Issue No. 05 - May (2017 vol. 50)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MC.2017.146
Zoltan Adam Mann , Budapest University of Technology and Economics
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.
Search problems, Computer science education, NP-hard problem, Algorithm design and analysis, Turing machines, Resource management