Tight Hardness Results for LCS and Other Sequence Similarity Measures

263 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Big Bird: Transformers for Longer Sequences (2020, background): “The impossibility for sparse-attention follows from hardness results stemming from Orthogonal Vector Conjecture(OVC) [1, 2, 7, 97].”
On The Computational Complexity of Self-Attention (2022, background): “In particular, this approach has been shown to provide conditional lower bounds on well-known problems such as edit distance [15], Frechet distance [16], dynamic time warping [17], longest common subsequence (LCS) [37], Hausdorff distance [38], and string matching [39].”