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 compute and return all the realizable subset sums up to the integer u in Õ(min { √nu,u5/4,σ }), where σ is the sum of all elements of S and Õ hides polylogarithmic factors. We also present a modified algorithm for integers modulo m, which computes all the realizable subset sums modulo m in Õ(min { √nm,m5/4}) time. Our contributions improve upon the standard dynamic programming algorithm that runs in O(nu) time. To the best of our knowledge, the new algorithms are the fastest deterministic algorithms for this problem. The new results can be employed in various algorithmic problems, from graph bipartition to computational social choice. Finally, we also improve a result on covering Zm, which might be of independent interest.