Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10472-019-09623-z / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128178116 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10472-019-09623-Z / rank | |||
Normal rank | |||
Latest revision as of 20:59, 17 December 2024
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
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
0 references
0 references
0 references
