A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum

DOI10.1137/1.9781611974782.69zbMath1423.90210arXiv1610.04712MaRDI QIDQ4575810

Karl Bringmann

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://arxiv.org/abs/1610.04712

Mathematics Subject Classification ID

90C27: Combinatorial optimization

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)