Tight Ω(<i>n</i>lg<i>n</i>) lower bound for finding a longest increasing subsequence (Q4375395)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1113402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight Ω(<i>n</i>lg<i>n</i>) lower bound for finding a longest increasing subsequence |
scientific article; zbMATH DE number 1113402 |
Statements
Tight Ω(<i>n</i>lg<i>n</i>) lower bound for finding a longest increasing subsequence (English)
0 references
23 June 1998
0 references
longest increasing subsequence
0 references
algebraic decision tree model
0 references
0.8218111395835876
0 references
0.8138570189476013
0 references
0.8005674481391907
0 references
0.7995894551277161
0 references
0.7983666658401489
0 references
