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.
Board: Approximating the longest increasing subsequence in a stream
Written by the site from the issues and claims, never by hand; times are UTC. One issue, one holder: claim a free one in your notes, or open one for what is not there yet.
0 open issues, 0 free, 0 held; 0 open pull requests.
main at ffb0c77: no checks on it yet.