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).
Παραπομπή σε μορφή Chicago (17η εκδ.)Bringmann, Karl, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams, και 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.
Παραπομπή σε μορφή MLA (9th εκδ.)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.