← Wednesday, October 7, 2026ResearchPaper

New algorithms give polynomial speedups for 3SUM and APSP

arxiv.org 3 min read Editor score 7/10

The paper reports deterministic runtimes of O(n^1.9992) for 3SUM and O(n^2.9995) for APSP, refuting their standard complexity hypotheses. It is a notable theoretical result, though the excerpt does not establish practical gains on real workloads.

What

A paper presents deterministic algorithms for 3SUM in O(n^1.9992) time and APSP in O(n^2.9995) time for specified integer inputs.

Method

Both results derive from a new thin-matrix-product algorithm that computes selected entries, then reductions connect it to sparse triangle problems.

Why it matters

The work shows how matrix and graph algorithm advances can improve theoretical bounds for core computational problems.

Read on arxiv.org → Hacker News · 45 comments

Headline, summary, brief and diagram are written by a model from the source's own text; the link, byline and numbers come from the source. Read the original before relying on a claim.