加入
Approximating the longest increasing subsequence in a stream
Find how much space a randomized streaming algorithm needs to approximate the longest increasing subsequence within a constant factor.
Update from the catalog #1
已合并
Find how much space a randomized streaming algorithm needs to approximate the longest increasing subsequence within a constant factor.