Papers & Research

Columbia and MIT paper shows Claude-discovered algorithms break long-standing speed limits for 3SUM and APSP

Original title:New Columbia and MIT paper shows that an algorithm Claude found beats the long-standing speed limits for 3SUM and all-pairs shortest paths.

AI summary

A paper from Columbia and MIT presents algorithms discovered by Claude that achieve polynomial improvements on 3SUM and all-pairs shortest paths (APSP), reaching O(n^1.9992) for 3SUM and O(n^2.9995) for APSP, refuting the 3SUM and APSP conjectures.

Key Takeaways

  • A paper from Columbia and MIT presents algorithms discovered by Claude that achieve polynomial…
  • 9992) for 3SUM and O(n^2.
  • 9995) for APSP,refuting the 3SUM and APSP conjectures.

Quick Facts

Published
Source
X:Rohan Paul (@rohanpaul_ai)
Category
Papers & Research
Topic
Anthropic / Claude
AI score
77
Read the original Read the full article at the original source
Why it matters

论文显示 Claude 发现的算法改进了 3SUM 和 APSP 的长期复杂度上限,并用 Lean 4 形式化验证,读者可以了解 AI 搜索算法的可行路径。

Topics

Related entities

Source & copyright

This article is based on curated titles and AI summaries from the AIHOT public API, with attribution and links back. Original copyright remains with the original publishers and authors; this site does not mirror full texts.

Original article · AIHOT entry

How to Cite

When citing this article, keep the title, date, and permalink, and credit Orange News as the source.

Orange News: Columbia and MIT paper shows Claude-discovered algorithms break long-standing speed limits for 3SUM and APSP. November 22, 2026. https://new.nat6.net/en/news/d32df9vzpliz9m348fug74inq/

View all →