Subquadratic 3SUM and Subcubic APSP
A new academic paper by Josh Alman and Virginia Vassilevska Williams explores subquadratic algorithms for the 3SUM problem and subcubic algorithms for All-Pairs Shortest Paths (APSP). The research focuses on leveraging sparse lopsided graphs to improve computational efficiency.
Why it matters
Advancements in these fundamental algorithmic problems have significant implications for computational complexity theory and the optimization of various software applications.
Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Josh Alman [ view email ] [v1] Mon, 5 Oct 2026 17:44:29 UTC (93 KB) Full-text links: Access Paper: View a PDF of the paper titled Truly Subquadratic 3SUM and Truly Subcubic APSP via Triangles in Sparse Lopsided Graphs, by Josh Alman and Virginia Vassilevska Williams View PDF HTML (experimental) TeX Source view license Current browse context: cs.DS < prev | next > new | recent | 2026-10 Change to browse by: cs cs.CC References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps?
Get smarter about the news
Sign up free for a feed built around what you actually care about, Dive Deeper research on any story, and the full text of every article.
Create free accountAlready have an account? Sign in