search
APSP problem
Trends
- 1
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.
- 2New arXiv paper claims subquadratic 3SUM and subcubic APSP algorithms●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.
- 3New progress claimed on 3SUM and APSP problems●Subquadratic 3SUM and Subcubic APSP https://arxiv.org/abs/2610.06783 # HackerNews # Tech # Algorithms
A new paper on arXiv claims subquadratic algorithms for the 3SUM problem and subcubic algorithms for all-pairs shortest paths, two of the most studied open problems in theoretical computer science. If verified, the results would break long-standing barriers that many researchers believed were optimal, making the claim a major talking point among algorithm experts.