Author:
Lingas Andrzej,Persson Mia
Publisher
Springer Nature Switzerland
Reference26 articles.
1. Alman, J., Vassilevska Williams, V.: A refined laser method and faster matrix multiplication. In: Proceedings of SODA, pp. 522–539 (2021)
2. Alon, N., Galil, Z., Margalit, D.: On the exponent of the all pairs shortest path problem. J. Comput. Syst. Sci. 54(2), 255–262 (1997)
3. Bringmann, K., Cassis, A.: Faster knapsack algorithms via bounded monotone min-plus-convolution. In: Proceedings of ICALP, pp. 31:1–31:21 (2022)
4. Bringmann, K., Grandoni, F., Saha, B., Vassilevska Williams, V.: Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product. SIAM J. Comput. 48(2), 481–512 (2019)
5. Bremner, D., et al.: Necklaces, convolutions and X+Y. Algorithmica 69, 294–314 (2014)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献