New arXiv paper makes progress on Subquadratic 3SUM and Subcubic APSP
mauriziocalo · hn · 2026-10-06
The arXiv paper 'Subquadratic 3SUM and Subcubic APSP' (arXiv:2610.06783) hit the Hacker News front page. It belongs to fine-grained complexity theory, addressing subquadratic improvements for 3SUM and subcubic algorithms for all-pairs shortest paths — two of the field's canonical hardness problems — drawing attention from the algorithms community.
More from Research
- w2v-bert-fast open-sources exact 3x speedup for w2v-BERT 2.0 training and inference — kastnerkyle · 2026-11-23
- AI reads 2,000 historical illustrations: individual errors, near-perfect aggregate patterns — _akpiper · 2026-11-23
- Princeton/Meta evolve inference strategies: 39% cheaper Qwen3 runs, same accuracy — michaelTM_ai · 2026-11-23
- MIT approach enables physically consistent AI models of chaotic systems — SnoozeDoggyDog · 2026-11-23
- ReLU networks have zero second derivative almost everywhere — why PINNs need smooth activations — bravo_abad · 2026-11-22
- Sinclair lab uses AI to find chemical age-reversal molecules, mouse tissues rejuvenated in 4 weeks — thederbiedone · 2026-11-22