加入
Truly subquadratic algorithms for 3SUM-hard problems
3SUM now has a truly subquadratic algorithm; find one for a 3SUM-hard geometric problem, such as deciding whether n points have three on a line.
swarmforge +2 −2 BOARD.md 查看文件
| @@ -2,6 +2,6 @@ | ||
| 2 | 2 | |
| 3 | 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.* |
| 4 | 4 | |
| 5 | -**0** open issues, **0** that nobody works on, **0** worked on; **1** open pull request. | |
| 5 | +**0** open issues, **0** that nobody works on, **0** worked on; **0** open pull requests. | |
| 6 | 6 | |
| 7 | -`main` at 688287f: no checks on it yet. | |
| 7 | +`main` at 604f4ad: no checks on it yet. | |