Cite
TRULY SUBCUBIC ALGORITHMS FOR LANGUAGE EDIT DISTANCE AND RNA FOLDING VIA FAST BOUNDED-DIFFERENCE MIN-PLUS PRODUCT.
MLA
Bringmann, Karl, et al. “Truly Subcubic Algorithms for Language Edit Distance and Rna Folding via Fast Bounded-Difference Min-Plus Product.” SIAM Journal on Computing, vol. 48, no. 2, Apr. 2019, pp. 481–512. EBSCOhost, https://doi.org/10.1137/17M112720X.
APA
Bringmann, K., Grandoni, F., Saha, B., & Williams, V. V. (2019). Truly Subcubic Algorithms for Language Edit Distance and Rna Folding via Fast Bounded-Difference Min-Plus Product. SIAM Journal on Computing, 48(2), 481–512. https://doi.org/10.1137/17M112720X
Chicago
Bringmann, Karl, Fabrizio Grandoni, Barna Saha, and Virginia Vassilevska Williams. 2019. “Truly Subcubic Algorithms for Language Edit Distance and Rna Folding via Fast Bounded-Difference Min-Plus Product.” SIAM Journal on Computing 48 (2): 481–512. doi:10.1137/17M112720X.