aifollow.news
Back Rohan Paul
Rohan Paul· @rohanpaul_ai · X· · Original publication time AI score68

Post says Claude found faster methods for 3SUM and all-pairs shortest pathsMachine translation

AI introduction

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.

Original post · Original

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

@rohanpaul_ai

– https://arxiv.org/abs/2610.06783

Title: "Truly Subquadratic 3SUM and Truly Subcubic APSP via Triangles in Sparse Lopsided Graphs"

ReplyRohan Paul@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.
View this post on X ↗

Source: Rohan Paul · x.com

Research
Found an error? Send a correction