Bringmann, K., Grandoni, F., Saha, B., Williams, V. V., & Laboratory, M. I. o. T. C. S. a. A. I. (2021). Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. Society for Industrial & Applied Mathematics (SIAM).
Lua i Stíl Chicago (17ú heag.)Bringmann, Karl, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams, agus Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory. Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. Society for Industrial & Applied Mathematics (SIAM), 2021.
Lua MLA (9ú heag.)Bringmann, Karl, et al. Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. Society for Industrial & Applied Mathematics (SIAM), 2021.