Improvised divide and conquer approach for the LIS problem (Q1748198)
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: Improvised divide and conquer approach for the LIS problem |
scientific article; zbMATH DE number 6867172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improvised divide and conquer approach for the LIS problem |
scientific article; zbMATH DE number 6867172 |
Statements
Improvised divide and conquer approach for the LIS problem (English)
0 references
9 May 2018
0 references
divide-and-conquer
0 references
longest increasing subsequence
0 references
principal row of Young tableaux
0 references
0 references
0.9195166
0 references
0.82793283
0 references
0 references
0.8209364
0 references
0.81751657
0 references
0.81646246
0 references
0.8150261
0 references
