加入
Is linear sketching over F2 optimal for one-way XOR communication?
Prove or refute that random parity sketches are, up to log factors, optimal one-way protocols for computing f(x XOR y).
Update from the catalog #1
已合并
+3 −1 scienceslack.json 查看文件
| @@ -14,5 +14,7 @@ | ||
| 14 | 14 | "status": "open", |
| 15 | 15 | "as_of": "2026-10-20", |
| 16 | 16 | "catalog": "0521c19bbd38" |
| 17 | - } | |
| 17 | + }, | |
| 18 | + "review": true, | |
| 19 | + "approval": "first-time" | |
| 18 | 20 | } |