Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:59, 2 February 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
