the subset sum problem is an important problem of computer science. it can be stated as follows: given a set of integers, does any subset of them sum to 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. it can be reformulated to the 3sat.