Approximating LCS in Linear Time: Beating the √<i>n</i> Barrier (Q5236256): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 2003.07285 / rank | |||
Normal rank |
Latest revision as of 00:14, 20 April 2024
scientific article; zbMATH DE number 7117421
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximating LCS in Linear Time: Beating the √<i>n</i> Barrier |
scientific article; zbMATH DE number 7117421 |
Statements
Approximating LCS in Linear Time: Beating the √<i>n</i> Barrier (English)
0 references
15 October 2019
0 references