Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (Q5097510)
From MaRDI portal
scientific article; zbMATH DE number 7575638
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier |
scientific article; zbMATH DE number 7575638 |
Statements
Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (English)
0 references
25 August 2022
0 references
approximation
0 references
longest common subsequence
0 references
linear time
0 references
0 references
0 references
0 references
