Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product

Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product

© 2019 Society for Industrial and Applied Mathematics It is a major open problem whether the (min, +)-product of two n × n matrices has a truly subcubic (i.e., O(n3−ε) for ε > 0) time algorithm; in particular, since it is equivalent to the famous all-pairs-shortest-paths problem (APSP) in n-verte...

Full description

Bibliographic Details
Main Authors: Bringmann, Karl, Grandoni, Fabrizio, Saha, Barna, Williams, Virginia Vassilevska
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:English
Published: Society for Industrial & Applied Mathematics (SIAM) 2021
Online Access:https://hdl.handle.net/1721.1/136191

Internet

https://hdl.handle.net/1721.1/136191

Similar Items