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:

    “A baby is a full time job for three adults. Nobody tells you that when you’re pregnant, or you’d probably jump off a bridge. Nobody tells you how all-consuming it is to be a mother—how reading goes out the window and thinking too.”
    —Erica Jong (20th century)

    “‘Tis to rebuke a vicious taste which has crept into thousands besides herself,—of reading straight forwards, more in quest of the adventures, than of the deep erudition and knowledge which a book of this cast, if read over as it should be, would infallibly impart.”
    —Laurence Sterne (1713–1768)