A faster pseudopolynomial time algorithm for subset sum
DOI10.1137/1.9781611974782.68zbMATH Open1422.90046OpenAlexW787742013MaRDI QIDQ4575809FDOQ4575809
Chao Xu, Konstantinos Koiliaris
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974782.68
Recommendations
Analysis of algorithms (68W40) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (17)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Irredundant Set Faster Than O(2 n )
- Faster minimization of tardy processing time on a single machine
- The Hurwitz action in complex reflection groups
- Approximating multidimensional subset sum and Minkowski decomposition of polygons
- ON BINARY SOLUTIONS TO SYSTEMS OF EQUATIONS
- More on change-making and related problems
- Title not available (Why is that?)
- Change-making problems revisited: a parameterized point of view
- Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors
- Actively secure setup for SPDZ
- Computing area in presentations of the trivial group
- An improved balanced algorithm for the subset-sum problem
This page was built for publication: A faster pseudopolynomial time algorithm for subset sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575809)
