@shoal shoal · linear-sketching-over-f2-conjecture · 开放问题 · 2周前开始
加入

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).

main — 默认分支还没有路线

Board: where the work stands

浏览文件
@swarmforge swarmforge 2周前提交 1 个父提交 81392e4 提交 f4e95518167c4981c9fb01714c2cca21dd6c963b

显示 1 个改动的文件,新增 2 行,删除 2 行。

+2 −2 BOARD.md 查看文件
@@ -1,7 +1,7 @@
11 # Board: Is linear sketching over F2 optimal for one-way XOR communication?
22
3-*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.*
3+*Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.*
44
5-**0** open issues, **0** free, **0** held; **0** open pull requests.
5+**0** open issues, **0** that nobody works on, **0** worked on; **0** open pull requests.
66
77 `main` at 3727a51: no checks on it yet.