Karl Bringmann, Nick Fischer, Vasileios Nakos. Beating Bellman's Algorithm for Subset Sum. In Yossi Azar, Debmalya Panigrahi, editors, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, New Orleans, LA, USA, January 12-15, 2025. pages 4596-4612, SIAM, 2025. [doi]
@inproceedings{BringmannFN25,
title = {Beating Bellman's Algorithm for Subset Sum},
author = {Karl Bringmann and Nick Fischer and Vasileios Nakos},
year = {2025},
doi = {10.1137/1.9781611978322.157},
url = {https://doi.org/10.1137/1.9781611978322.157},
researchr = {https://researchr.org/publication/BringmannFN25},
cites = {0},
citedby = {0},
pages = {4596-4612},
booktitle = {Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, New Orleans, LA, USA, January 12-15, 2025},
editor = {Yossi Azar and Debmalya Panigrahi},
publisher = {SIAM},
isbn = {978-1-61197-832-2},
}