An algorithm for the determination of longest increasing subsequence in a sequence (Q1119638)
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: An algorithm for the determination of longest increasing subsequence in a sequence |
scientific article; zbMATH DE number 4097379
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for the determination of longest increasing subsequence in a sequence |
scientific article; zbMATH DE number 4097379 |
Statements
An algorithm for the determination of longest increasing subsequence in a sequence (English)
0 references
1989
0 references
longest increasing subsequence
0 references
0.92685276
0 references
0.9251161
0 references
0.9183589
0 references
0 references
0.9126619
0 references
0.90933114
0 references
0.90617406
0 references
0.90150493
0 references
0.9014297
0 references
