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