Faster Algorithms for Computing Longest Common Increasing Subsequences (Q5307517)

From MaRDI portal
Revision as of 15:20, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5191222
Language Label Description Also known as
English
Faster Algorithms for Computing Longest Common Increasing Subsequences
scientific article; zbMATH DE number 5191222

    Statements

    Faster Algorithms for Computing Longest Common Increasing Subsequences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 September 2007
    0 references
    0 references
    0 references