Mmastodon BusinessStartups first seen 1 d ago, last 1 d ago, peak #5
New arXiv paper claims subquadratic 3SUM and subcubic APSP algorithms
Original: Subquadratic 3SUM and Subcubic APSP Article URL: https:// arxiv.org/abs/2610.06783 Comments URL: https:// news.ycombinat
A new paper on arXiv reports progress on two landmark problems in theoretical computer science: 3SUM, where the authors claim a subquadratic-time algorithm, and all-pairs shortest paths (APSP), with a claimed subcubic-time algorithm. Both problems have long-standing conjectures asserting such speedups are impossible, so if the results hold up they would overturn widely believed hardness assumptions. The work is drawing early attention from algorithm researchers discussing its validity.
Why now: Claims to beat the 3SUM and APSP conjectures would be a major theoretical breakthrough, prompting researchers to scrutinize the proofs.
Rank over time, top of the chart is #1. 3 snapshots from 1 d ago to 1 d ago.
Evidence
API: https://socialmediatrends-api.osmike.com/v1/trends/1285389