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:
“There is a note in the front of the volume saying that no public reading ... may be given without first getting the author’s permission. It ought to be made much more difficult to do than that.”
—Robert Benchley (1889–1945)
“I have this very moment finished reading a novel called The Vicar of Wakefield [by Oliver Goldsmith].... It appears to me, to be impossible any person could read this book through with a dry eye and yet, I don’t much like it.... There is but very little story, the plot is thin, the incidents very rare, the sentiments uncommon, the vicar is contented, humble, pious, virtuous—but upon the whole the book has not at all satisfied my expectations.”
—Frances Burney (1752–1840)