Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598)

From MaRDI portal
Revision as of 00:41, 1 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128178116, #quickstatements; #temporary_batch_1722468928777)
scientific article
Language Label Description Also known as
English
Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence
scientific article

    Statements

    Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 February 2020
    0 references
    Euclidean space
    0 references
    largest subset
    0 references
    longest subsequence
    0 references
    quadratic variation
    0 references
    exact algorithm
    0 references
    pseudopolynomial time
    0 references

    Identifiers