All Events

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

Josh Alman

Friday, November 06, 2026 · 12:30 PM

CSB 453

I’ll talk about new faster algorithms for 3SUM, APSP, and many more problems. They all follow from one new algorithm for quickly computing certain entries of a matrix product. That algorithm was found by Anthropic using an internal model of Claude. They then contacted me and Virginia Vassilevska Williams to understand and properly write up the algorithm.
I’ll talk about the algorithm itself, what it means for fine-grained complexity, and the experience of being contacted by Anthropic and putting this paper together.
Paper on arXiv: https://arxiv.org/pdf/2610.06783

AMSTERDAM AVENUEBROADWAYCLAREMONT AVENUECOLLEGE WALKMORNINGSIDE DRIVERIVERSIDE DRIVE116TH STREET118TH STREET119TH STREET120TH STREET121ST STREET122ND STREET123RD STREETMuddNWCCEPSRSSWDodge HallKent HallRussellZankelLow LibraryAlma Mater1116 StMorningside ParkNComputer Science Building
CSB 453 · Computer Science Building Map data © OpenStreetMap contributors
morningside campus

Computer Science Building

CSB 453

Map data © OpenStreetMap contributors