Approximating LCS in Linear Time: Beating the √<i>n</i> Barrier (Q5236256): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Importer (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2903274221 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2003.07285 / rank
 
Normal rank

Latest revision as of 01: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
    0 references
    0 references
    0 references
    15 October 2019
    0 references
    0 references
    0 references
    0 references