Advertisement

Hard Problems and (Limited) Sloppiness

  • Magnus Lie Hetland

Abstract

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.

Keywords

Polynomial Time Knapsack Problem Hard Problem Hamilton Cycle Vertex Cover 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arora, S. and Barak, B. (2009). Computational Complexity: A Modern Approach. Cambridge University Press.Google Scholar
  2. 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]
  3. 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
  4. Goldreich, O. (2010). P, NP, and NP-Completeness: TheBasics of Computational Complexity. Cambridge University Press.Google Scholar
  5. Harel, D. (2000). Computers Ltd: What They Really Can’t Do. Oxford University Press.Google Scholar
  6. Hemaspaandra, L. A. and Ogihara, M. (2002). The Complexity Theory Companion. Springer.Google Scholar
  7. Hochbaum, D. S., editor (1997). Approximation Algorithms for NP-Hard Problems. PWS Publishing Company.Google Scholar
  8. 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]
  9. Kolesar, P. J. (1967). A branch and bound algorithm for the knapsack problem. Management Science, 13(9):723–735. [http://www.jstor.org/pss/2628089]CrossRefGoogle Scholar
  10. Vazirani, V. V. (2010). Approximation Algorithms. Springer.Google Scholar

Copyright information

© by Magnus Lie Hetland 2010

Authors and Affiliations

  • Magnus Lie Hetland

There are no affiliations available

Personalised recommendations