CSFG
English Deutsch Beta Español Beta język polski (2.6.0)
Chapters Curriculum Guides Appendices

Complexity and Tractability
12.8. Further reading

Complexity and Tractability

  • 12.1. What's the big picture?
  • 12.2. Algorithms, problems, and speed limits
  • 12.3. Tractability
  • 12.4. The Travelling Salesman Problem
  • 12.5. Bin packing problem
  • 12.6. Other intractable problems
  • 12.7. The whole story!
  • 12.8. Further reading
    • Useful links

This topic is covered very thoroughly in a way that is accessible to non-specialists in a popular book by David Harel called "Computers Ltd.: What They Really Can't Do".

12.8.1.

Useful links

  • https://en.wikipedia.org/wiki/Computational_complexity_theory
  • http://www.tsp.gatech.edu/games/index.html
  • http://csunplugged.org/graph-colouring
  • https://en.wikipedia.org/wiki/Travelling_salesman_problem
  • https://en.wikipedia.org/wiki/Knapsack_problem
  • https://en.wikipedia.org/wiki/Bin_packing_problem
  • https://en.wikipedia.org/wiki/Hamiltonian_path
  • https://en.wikipedia.org/wiki/Brute-force_search
Previous:
The whole story!
Next:
Computer Graphics

Looking for something for primary schools? Check out CS Unplugged.

The Computer Science Field Guide is an online interactive resource for high school students learning about computer science.

Useful Links

  • About
  • Chapters
  • Interactives
  • Curriculum Guides

Community

  • Twitter
  • YouTube
  • GitHub

Help

  • Search
  • Glossary
  • Feedback

Switch to teacher mode

English | Deutsch | Español | język polski (2.6.0)

The Computer Science Field Guide material is open source on GitHub, and this website's content is shared under a Creative Commons Attribution-ShareAlike 4.0 International license. The Computer Science Field Guide is a project by the Computer Science Education Research Group at the University of Canterbury, New Zealand. Icons provided generously by icons8.

3.12.6

This definition is not available in English, sorry!