Another look at the ''longest ascending subsequence'' problem (Q1154283)

From MaRDI portal
Revision as of 12:42, 13 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Another look at the ''longest ascending subsequence'' problem
scientific article

    Statements

    Another look at the ''longest ascending subsequence'' problem (English)
    0 references
    0 references
    1981
    0 references
    0 references
    efficient algorithm
    0 references
    monotonic subsequences
    0 references
    0 references