Subset sum made faster

Konstantinos and Chao have a new version of their subset sum paper on the arxiv.  They speed up  the classical subset sum algorithm by a factor of sqrt(n)  using clever divide and conquer strategy.  This version is reasonably well written and is quite elegant. A nice paper!

Comments are closed.