1. Martello, Silvano and Toth, Paolo. (1990). Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons. ISBN 0-471-92420-2.

2. Michael R. Gary and David S. Johnson (1979).Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman. ISBN 0-7167-1045-5.

3. Kohonen, Teuvo. (2005) The Self-Organizing Map. Laboratory of Computer and Information Science, Adaptive Informatics Research Centre.

4. "NP-hard" From Wikipedia, the free encyclopedia - http://en.wikipedia.org/wiki/NP-hard

5. "Polynomial time" From Wikipedia, the free encyclopedia - http://en.wikipedia.org/wiki/Polynomial_time

6. "Non-deterministic Turing machine" From Wikipedia, the free encyclopedia - http://en.wikipedia.org/wiki/Non-deterministic_Turing_machine

7. "Knapsack problem" From Wikipedia, the free encyclopedia - http://en.wikipedia.org/wiki/Knapsack_problem

8. "Dynamic Programming" From Wikipedia, the free encyclopedia - http://en.wikipedia.org/wiki/Dynamic_programming

9. "Comp. Theory FAQ" - http://www.cs.uwaterloo.ca/~alopez-o/comp-faq/faq.html