Approximating LCS in Linear Time: Beating the √<i>n</i> Barrier (Q5236256): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 19:24, 5 March 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
