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:

    “Any reading not of a vicious species must be a good substitute for the amusements too apt to fill up the leisure of the labouring classes.”
    —James Madison (1751–1836)

    “... 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)