Author:
Bringmann Karl,Nakos Vasileios
Publisher
Society for Industrial and Applied Mathematics
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Approximating Partition in Near-Linear Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. (1 −
)-Approximation of Knapsack in Nearly Quadratic Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
4. 0-1 Knapsack in Nearly Quadratic Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
5. Approximating subset sum ratio via partition computations;Acta Informatica;2024-01-12