Faster space-efficient algorithms for subset sum and k-sum
From MaRDI portal
Publication:4977972
DOI10.1145/3055399.3055467zbMath1369.68348OpenAlexW2626471773MaRDI QIDQ4977972
Nikhil Bansal, Nikhil Vyas, Shashwat Garg, Jesper Nederlof
Publication date: 17 August 2017
Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3055399.3055467
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Randomized algorithms (68W20)
Related Items (5)
Unnamed Item ⋮ Improved combinatorial algorithms for the inhomogeneous short integer solution problem ⋮ Unnamed Item ⋮ Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems ⋮ Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
This page was built for publication: Faster space-efficient algorithms for subset sum and k-sum
