aifollow.news
Back Rohan Paul
Rohan Paul· @rohanpaul_ai · X· · Original publication time SelectedAI score74

Columbia and MIT paper reports Claude-found speedups for 3SUM and all-pairs shortest pathsMachine translation

AI introduction

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.

Original post · Original

The article text is unavailable in this language; an existing version is shown.

@rohanpaul_ai

New Columbia and MIT paper shows that an algorithm Claude found beats the long-standing speed limits for 3SUM and all-pairs shortest paths.

3SUM asks whether 3 numbers in a list sum to 0, and all-pairs shortest paths asks for every distance in a graph. For decades, nobody beat textbook quadratic and cubic time by more than tiny factors, and many assumed nobody could.

Claude found a faster way to compute selected entries of a product of 2 long, thin matrices, skipping work a classic method does. Known reductions then turn this into speedups for 3SUM, shortest paths, and many related problems.

3SUM now runs in O(n^1.9992) time and shortest paths in O(n^2.9995), tiny gains that still refute the 3SUM and APSP hypotheses. Claude found the method in 1 session using 16M output tokens with no human input.

Treat "known hard" algorithm limits as open targets for AI search, and check AI-found proofs formally, as this paper did with Lean 4.

Source: Rohan Paul · x.com

Research
Found an error? Send a correction