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:

    “... in doing our psychology, we want to attribute mental states fully opaquely because it’s the fully opaque reading which tells us what the agent has in mind, and it’s what the agent has in mind that causes his behavior.”
    —Jerry Alan Fodor (b. 1935)

    “I knew you forever and you were always old,
    soft white lady of my heart. Surely you would scold
    me for sitting up late, reading your letters....”
    —Anne Sexton (1928–1974)