Sorting sums of binary decision summands

Torsten Gross, Nils Blüthgen

A sum where each of the $N$ summands can be independently chosen from two choices yields $2^N$ possible summation outcomes. There is an $\mathcal{O}(K^2)$-algorithm that finds the…