Beating Bellman's Algorithm for Subset Sum

Bellman's algorithm for Subset Sum is one of the earliest and simplest examples of dynamic programming, dating back to 1957. For a given set of n integers X and a target t, it computes the set of subset sums S(X, t) (i.e., the set of integers s ∈ [0 . . . t] for which there is a subset of X summing to s) in time O(|S(X, t)| • n). Since then, it has been an important question whether Bellman's seminal algorithm can be improved. This question is addressed in many recent works. And yet, while some algorithms improve upon Bellman's algorithm in specific parameter regimes, such as Bringmann's O(t + n)-time algorithm [SODA '17] and Bringmann and Nakos' O(|S(X, t)| 4/3 )-time algorithm [STOC '20], none of the known algorithms beats Bellman's algorithm in all regimes. In particular, it remained open whether Subset Sum is in time O(|S(X, t)| • n 1-ϵ ) (for some ϵ > 0).

In this work we positively resolve this question and design an algorithm that outperforms Bellman's algorithm in all regimes. Our algorithm runs in time O(|S(X, t)|• √ n), thus improving the time complexity by a factor of nearly √ n. Our key innovation is the use of a result from additive combinatorics, which has not been applied in an algorithmic context before and which we believe to be of further independent interest for algorithm design. To demonstrate the broader applicability of our approach, we extend our ideas to a variant of Subset Sum on vectors as well as to Unbounded Subset Sum.