Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence (Q5390602)
From MaRDI portal
scientific article; zbMATH DE number 5874040
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence |
scientific article; zbMATH DE number 5874040 |
Statements
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence (English)
0 references
4 April 2011
0 references
streaming algorithms
0 references
communication complexity
0 references
longest increasing subsequence
0 references
direct sum problem
0 references
