Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence.
Anna GálParikshit GopalanPublished in: SIAM J. Comput. (2010)
Keyphrases
- lower bound
- upper bound
- learning algorithm
- orders of magnitude
- worst case
- upper and lower bounds
- computational cost
- computational complexity
- computationally efficient
- machine learning algorithms
- benchmark datasets
- data structure
- scheduling problem
- theoretical analysis
- tabu search
- times faster
- sample complexity
- real time