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:

    “Nothing is so engaging as the little domestic cares into which you appear to be entering, and as to reading it is useful for only filling up the chinks of more useful and healthy occupations.”
    —Thomas Jefferson (1743–1826)

    “The words of the Constitution ... are so unrestricted by their intrinsic meaning or by their history or by tradition or by prior decisions that they leave the individual Justice free, if indeed they do not compel him, to gather meaning not from reading the Constitution but from reading life.”
    —Felix Frankfurter (1882–1965)