💡New Paper Solves 3SUM and APSP Faster
3SUM and APSP just got a lot faster
TL;DR
A new paper by Josh Alman and Virginia Vassilevska Williams solves 3SUM in O(n^1.9992) and APSP in O(n^2.9995), marking the first polynomial improvements over textbook algorithms. This breakthrough could change algorithmic efficiency in data structures and computational complexity.
Josh Alman and Virginia Vassilevska Williams just dropped a paper that solves 3SUM in O(n^1.9992) and APSP in O(n^2.9995) time, the first polynomial improvements over textbook algorithms. If you're working on complex data structures or computational problems, this could mean faster algorithms and better efficiency. The paper also refutes several long-standing hypotheses and introduces a new algorithm for thin matrix products. This is a big deal for anyone dealing with large datasets and complex computational tasks.
Key Points
New paper solves 3SUM in O(n^1.9992) time, a first since textbook algorithms.
APSP problem solved in O(n^2.9995) time, also a first polynomial improvement.
Paper refutes 3SUM, APSP, Exact Triangle, and Zero-Weight k-Clique hypotheses.
76-page paper introduces a new algorithm for thin matrix products.
Algorithm computes (XY)[I,J] entries in O(N^2/D^0.063) operations.
Why It Matters
If you're working on complex data structures or computational problems, this paper could change your workflow. Solving 3SUM and APSP faster means more efficient algorithms and better performance. The new algorithm for thin matrix products could also offer significant speedups for specific computational tasks.
Comments
Be the first to comment
Enjoyed this article?
Get it daily. 7am. Free. Reads in 5 minutes.
Join 3,555 builders reading daily.