AI Trends

Columbia University and MIT Paper Says Claude Algorithm Breaks Long-Standing Speed Barriers for 3SUM and All-Pairs Shortest Paths

Rohan PaulUpdated Nov 22 03:38

AI summary

A paper from Columbia University and MIT says algorithms discovered by Claude reduce the time complexities of 3SUM and all-pairs shortest paths to O(n^1.9992) and O(n^2.9995), respectively. The approach achieves speedups by reducing the work required to compute specific entries in the product of two long, narrow matrices, and can be applied to related problems via known reductions. Claude discovered the method in a single session using 16M output tokens and no human input, and the paper verified the relevant arguments with Lean 4.

Why read this

SelectedAI score 83

The paper demonstrates a concrete path for using AI to discover improvements to theoretical algorithms and formally verifies the resulting arguments with Lean 4.

Topics

Tags

Body

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