Faster space-efficient algorithms for subset sum and k-sum
From MaRDI portal
Publication:4977972
DOI10.1145/3055399.3055467zbMATH Open1369.68348OpenAlexW2626471773MaRDI QIDQ4977972FDOQ4977972
Authors: N. Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas 
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
Recommendations
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
- Space-efficient randomized algorithms for \(k\)-sum
- A near-linear pseudopolynomial time algorithm for subset sum
- Faster algorithms for \(k\)-subset sum and variations
- Space-time tradeoffs for subset sum: an improved worst case algorithm
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Combinatorial optimization (90C27)
Cited In (11)
- Faster algorithms for \(k\)-subset sum and variations
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- Space-time tradeoffs for subset sum: an improved worst case algorithm
- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers
- Saving space by algebraization
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Space-efficient randomized algorithms for \(k\)-sum
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem
This page was built for publication: Faster space-efficient algorithms for subset sum and \(k\)-sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4977972)
