Yhn first seen 1 d ago, last 1 d ago, peak #12
New theoretical results on 3SUM and APSP problems
Original: Subquadratic 3SUM and Subcubic APSP
A new paper posted on arXiv claims subquadratic algorithms for the 3SUM problem and subcubic algorithms for all-pairs shortest paths, two of the most studied problems in theoretical computer science. If verified, the results would mark a significant breakthrough on longstanding open questions in fine-grained complexity, and researchers are examining the proofs closely.
Why now: A claimed breakthrough on two famous open problems in algorithms research naturally draws intense scrutiny from the computer science community.
Evidence
- Subquadratic 3SUM and Subcubic APSP · mauriziocalo · 91
API: https://socialmediatrends-api.osmike.com/v1/trends/1249133