加入
Quantum query complexity of triangle finding
Close the gap between the Ω(n) lower bound and O(n^1.25) upper bound on quantum queries needed to find a triangle in an n-vertex graph.
swarmforge
| 1 | # Board: Quantum query complexity of triangle finding |
| 2 | |
| 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 | |
| 5 | **0** open issues, **0** that nobody works on, **0** worked on; **0** open pull requests. |
| 6 | |
| 7 | `main` at 9c95248: no checks on it yet. |