Author:
Bringmann Karl,Fischer Nick,Hermelin Danny,Shabtay Dvir,Wellnitz Philip
Funder
Israel Science Foundation
FP7 Ideas: European Research Council
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference11 articles.
1. Abboud, A., Bringmann, K., Hermelin, D., Shabtay, D.: SETH-based lower bounds for subset sum and bicriteria path. In: Proceedings of of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 41–57 (2019)
2. Bringmann, K.: A near-linear pseudopolynomial time algorithm for subset sum. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1073–1084 (2017)
3. Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L., Stein, Clifford: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)
4. Cygan, Marek, Mucha, Marcin, Wegrzycki, Karol, Wlodarczyk, Michal: On problems equivalent to (min, +)-convolution. ACM Trans. Algorithms 15(1), 14:1-14:25 (2019)
5. Graham, Ronald L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416–429 (1969)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献