Subset Sum Problem - Further Reading

Further Reading

  • Cormen, Thomas H.; Leiserson, Charles E., Rivest, Ronald L., Stein, Clifford (2001) . "35.5: The subset-sum problem". Introduction to Algorithms (2nd ed.). MIT Press and McGraw-Hill. ISBN 0-262-03293-7.
  • Michael R. Garey and David S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman. ISBN 0-7167-1045-5. A3.2: SP13, pg.223.

Read more about this topic:  Subset Sum Problem

Famous quotes containing the word reading:

    “After all, what is reading but a vice, like drink or venery or any other form of excessive self-indulgence? One reads to tickle and amuse one’s mind; one reads, above all, to prevent oneself thinking.”
    —Aldous Huxley (1894–1963)

    “He is to the great poet, what an excellent mimic is to a great actor. There is no determinate impression left on the mind by reading his poetry.... A great mind is one that moulds the minds of others.”
    —William Hazlitt (1778–1830)