A Faster Pseudopolynomial Time Algorithm for Subset Sum

DOI10.1137/1.9781611974782.68zbMath1422.90046OpenAlexW787742013MaRDI QIDQ4575809

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (13)

Approximating multidimensional subset sum and Minkowski decomposition of polygons ⋮ Faster minimization of tardy processing time on a single machine ⋮ Change-making problems revisited: a parameterized point of view ⋮ Computing area in presentations of the trivial group ⋮ Unnamed Item ⋮ An improved balanced algorithm for the subset-sum problem ⋮ ON BINARY SOLUTIONS TO SYSTEMS OF EQUATIONS ⋮ Unnamed Item ⋮ Unnamed Item ⋮ More on change-making and related problems ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum ⋮ The Hurwitz action in complex reflection groups ⋮ Actively secure setup for SPDZ

This page was built for publication: A Faster Pseudopolynomial Time Algorithm for Subset Sum