Hard Problems and (Limited) Sloppiness
This book is clearly about algorithmic problem solving. Until now, the focus has been on basic principles for algorithm design, as well as examples of important algorithms in many problem domains. Now, I’ll give you a peek at the flip side of algorithmics: hardness. Although it is certainly possible to find efficient algorithms for many important and interesting problems, the sad truth is that most problems are really hard. In fact, most are so hard that there’s little point in even trying to solve them. It then becomes important to recognize hardness, to show that a problem is intractable (or at least very likely so), and to know what alternatives there are to simply throwing your hands up.
KeywordsPolynomial Time Knapsack Problem Hard Problem Hamilton Cycle Vertex Cover
Unable to display preview. Download preview PDF.
- Arora, S. and Barak, B. (2009). Computational Complexity: A Modern Approach. Cambridge University Press.Google Scholar
- Crescenzi, G. A., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., and Protasi, M. (1999). Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer. [Appendix online: ftp://ftp.nada.kth.se/Theory/Viggo-Kann/compendium.pdf]
- Garey, M. R. and Johnson, D.S. (2003). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company. Twenty-fourth printing.Google Scholar
- Goldreich, O. (2010). P, NP, and NP-Completeness: TheBasics of Computational Complexity. Cambridge University Press.Google Scholar
- Harel, D. (2000). Computers Ltd: What They Really Can’t Do. Oxford University Press.Google Scholar
- Hemaspaandra, L. A. and Ogihara, M. (2002). The Complexity Theory Companion. Springer.Google Scholar
- Hochbaum, D. S., editor (1997). Approximation Algorithms for NP-Hard Problems. PWS Publishing Company.Google Scholar
- Impagliazzo, R. (1995). A personal view of average-case complexity. In Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT’ 95), pages 134–147. [http://cseweb.ucsd.edu/~russell/average.ps]
- Vazirani, V. V. (2010). Approximation Algorithms. Springer.Google Scholar