Space-efficient algorithms for longest increasing subsequence (Q1987516)
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: Space-efficient algorithms for longest increasing subsequence |
scientific article; zbMATH DE number 7189483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Space-efficient algorithms for longest increasing subsequence |
scientific article; zbMATH DE number 7189483 |
Statements
Space-efficient algorithms for longest increasing subsequence (English)
0 references
15 April 2020
0 references
longest increasing subsequence
0 references
patience sorting
0 references
space-efficient algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9977668523788452
0 references
0.8400580883026123
0 references
0.8274898529052734
0 references
0.8265920281410217
0 references
0.8210855722427368
0 references
