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).
शिकागो शैली (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.
एमएलए (9वां संस्करण) प्रशस्ति पत्र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.