CentralNotice From Wikipedia, the free encyclopedia Jump to: navigation , search This article needs additional citations for verification . Please help improve this article by adding citations to reliable sources . Unsourced material may be challenged and removed. (December 2008) In computer science , the subset sum problem is one of the important problem in complexity theory and cryptography . The problem is this: given a set (or multiset ) of integers, is there a non-empty subset whose sum is zero? For example, given the set {−7, −3, −2, 5, 8}, the answer is yes because the subset {−3, −2, 5} sums to zero. The problem is NP-complete . An equivalent problem is this: given a set of integers and an integer s , does any non-empty subset sum to s ? Subset sum can also be thought of as a special case of the knapsack problem . [ 1 ] One interesting special case of s...