< BACK TO NEWS
importantSYS.SOURCE: arXiv• 2026-10-06T12:31:17Z

Efficient Algorithms for 3SUM and APSP via Sparse Lopsided Graphs

This paper presents polynomial-time improvements for 3SUM and APSP problems, achieving O(n^1.9992) and O(n^2.9995) algorithms respectively. It introduces a novel matrix product algorithm that enables subquadratic triangle detection in sparse lopsided graphs, refuting multiple computational complexity hypotheses.

Comments

Read original article

*** END OF TRANSMISSION ***