Solving dense subset-sum problems by using analytical number theory

AbstractTheorems from analytical number theory are used to derive new algorithms for the subset-sum problem. The algorithms work for a large number of variables (m) with values that are bounded above. The bound (l) depends moderately on m. While the dynamic programming approach yields an O(lm2) algorithm, the new algorithms are substantially faster