Tight Ω(<i>n</i>lg<i>n</i>) lower bound for finding a longest increasing subsequence (Q4375395)
From MaRDI portal
scientific article; zbMATH DE number 1113402
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
