New arXiv paper makes progress on Subquadratic 3SUM and Subcubic APSP

mauriziocalo · hn · 2026-10-06

The arXiv paper 'Subquadratic 3SUM and Subcubic APSP' (arXiv:2610.06783) hit the Hacker News front page. It belongs to fine-grained complexity theory, addressing subquadratic improvements for 3SUM and subcubic algorithms for all-pairs shortest paths — two of the field's canonical hardness problems — drawing attention from the algorithms community.

Original post →

More from Research

Research channel →