Enumerating longest increasing subsequences and patience sorting (Q294846)
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: Enumerating longest increasing subsequences and patience sorting |
scientific article; zbMATH DE number 6594138
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating longest increasing subsequences and patience sorting |
scientific article; zbMATH DE number 6594138 |
Statements
Enumerating longest increasing subsequences and patience sorting (English)
0 references
16 June 2016
0 references
algorithms
0 references
longest increasing subsequence
0 references
van Emde Boas tree
0 references
0 references
0.92880046
0 references
0.9045561
0 references
0.9028853
0 references
0.8918162
0 references
0.88890857
0 references
0.8860429
0 references
0.8829277
0 references
