Approximating LCS in Linear Time: Beating the √<i>n</i> Barrier (Q5236256)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating LCS in Linear Time: Beating the √n Barrier |
scientific article; zbMATH DE number 7117421
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.90774363
0 references
0.87805235
0 references
0.87304795
0 references
0.87304795
0 references
0.8692668
0 references
0 references
0 references
0.86542386
0 references
0.85968155
0 references
