– https://arxiv.org/abs/2610.06783
据材料所引述的帖子,Claude发现了一种更快计算两个细长矩阵乘积中选定元素的方法,论文据此给出了3SUM和全点对最短路径问题的加速算法。
2 reports2 sources
Reports 2
Post says Claude found faster methods for 3SUM and all-pairs shortest paths
A post describing a Columbia and MIT paper says Claude found a way to compute selected entries in the product of two long, thin matrices while skipping some work done by a classic method. It reports running times of O(n^1.9992) for 3SUM and O(n^2.9995) for all-pairs shortest paths, describing the gains as tiny.
1 more source reported this
- Rohan Paul (@rohanpaul_ai)
Columbia and MIT paper reports Claude-found speedups for 3SUM and all-pairs shortest paths
The paper says Claude found a way to skip work when computing selected entries of a matrix product. Known reductions yield O(n^1.9992) time for 3SUM and O(n^2.9995) for all-pairs shortest paths. The gains are small, but the paper says they refute long-standing complexity hypotheses; it checked the proofs with Lean 4.
1 more source reported this
- Rohan Paul (@rohanpaul_ai)
SourceRohan Paul (@rohanpaul_ai) ↗Rohan Paul (@rohanpaul_ai) ↗