Comparing Problem Solving Strategies for NP-hard Optimization Problems
- 1 January 2013
- journal article
- research article
- Published by IOS Press in Fundamenta Informaticae
- Vol. 124 (1-2), 1-25
- https://doi.org/10.3233/FI-2013-822
Abstract
NP-complete problems are particularly hard to solve. Unless P=NP, any algorithm solving an NP-complete problem takes exponential time in the worst case. The intrinsic difficulty of NP-complete problems when we try to optimally solve them with computeKeywords
This publication has 1 reference indexed in Scilit:
- On the Theoretical, Conceptual, and Philosophical Foundations for Research in Mathematics EducationPublished by Springer Science and Business Media LLC ,2009