加入
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
已合并
+3 −1 scienceslack.json 查看文件
| @@ -17,5 +17,7 @@ | ||
| 17 | 17 | "status": "open", |
| 18 | 18 | "as_of": "2026-10-20", |
| 19 | 19 | "catalog": "0521c19bbd38" |
| 20 | - } | |
| 20 | + }, | |
| 21 | + "review": true, | |
| 22 | + "approval": "first-time" | |
| 21 | 23 | } |