Faster Pseudopolynomial Time Algorithms for Subset Sum

Given a (multi) set S of n positive integers and a target integer u, the subset sum problem is to decide if there is a subset of S that sums up to u. We present a series of new algorithms that comp...