Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence |
scientific article; zbMATH DE number 7166071
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence |
scientific article; zbMATH DE number 7166071 |
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
0.8990847
0 references
0.89543825
0 references
0.8944266
0 references
0.8872851
0 references
0 references
0.8866911
0 references
0.88556683
0 references
0.88257277
0 references
0.88109237
0 references
