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:

    “When I have seen fine statues, and afterwards enter a public assembly, I understand well what he meant who said, “When I have been reading Homer, all men look like giants.””
    —Ralph Waldo Emerson (1803–1882)

    “Much reading is an oppression of the mind, and extinguishes the natural candle, which is the reason of so many senseless scholars in the world.”
    —William Penn (1644–1718)