A Fast Polynomial Space Algorithm for Subset Sum

  • Nikhil Bansal | Eindhoven University of Technology

I will describe an algorithm for the subset sum problem that runs in 2^{0.86n} time and uses polynomial pace. Previously, all algorithms with running time less than 2^n used exponential space, and obtaining such a guarantee was open. Our algorithm is based on Floyd’s space efficient technique for cycle finding, and builds on some recent work of Beame et al. Based on joint work with Shashwat Garg, Jesper Nederlof and Nikhil Vyas

    • Portrait of Casey Anderson

      Casey Anderson

  • Research Area

Series: Microsoft Research Talks