Editing Subset sum problem (section)

==Further reading==
* {{Introduction to Algorithms|2|chapter=35.5: The subset-sum problem}}
* {{cite book | author = [[Michael R. Garey]] and [[David S. Johnson]] | year = 1979 | title = Computers and Intractability: A Guide to the Theory of NP-Completeness | publisher = W.H. Freeman | isbn = 0-7167-1045-5 | url-access = registration | url = https://archive.org/details/computersintract0000gare }} A3.2: SP13, pg.223.
* {{Cite journal|last1=Lagarias|first1=J. C.|last2=Odlyzko|first2=A. M.|date=1985-01-01|title=Solving low-density subset sum problems|journal=Journal of the ACM|volume=32|issue=1|pages=229–246|doi=10.1145/2455.2461|s2cid=885632|issn=0004-5411|doi-access=free}}
* {{cite book|last1=Martello|first1=Silvano|title=Knapsack problems: Algorithms and computer interpretations|last2=Toth|first2=Paolo|publisher=Wiley-Interscience|year=1990|isbn=0-471-92420-2|pages=[https://archive.org/details/knapsackproblems0000mart/page/105 105–136]|chapter=4 Subset-sum problem|mr=1086874|chapter-url=https://archive.org/details/knapsackproblems0000mart/page/105}}

{{DEFAULTSORT:Subset Sum Problem}}
[[Category:Weakly NP-complete problems]]
[[Category:Dynamic programming]]
[[Category:Articles with example pseudocode]]