PulseAugur
EN
LIVE 16:01:06
Русский(RU) Задача 3SUM решена быстрее, чем за O(N²) — а именно за O(N¹·⁹⁹⁹²). Без нейронок не обошлось 5 октября американские исследователи Вирджиния Василевска-Уильямс, и

3SUM problem solved faster than O(N²) with AI assistance

By PulseAugur Editorial · [1 sources] ·

Researchers have developed a new algorithm that solves the 3SUM problem in O(N¹·⁹⁹⁹²) time, a significant improvement over the previously assumed lower bound of O(N²). This breakthrough also resolves the All-Pairs Shortest Paths (APSP) problem, which has practical applications in computational geometry. Notably, the researchers claim that Anthropic's Claude model played a role in discovering and refining the initial algorithm. AI

IMPACT This breakthrough in algorithmic complexity, aided by AI, could accelerate research in computational geometry and related fields.

RANK_REASON The cluster describes a new algorithm for a computational problem and its publication as a preprint. [lever_c_demoted from research: ic=1 ai=0.7]

Read on Mastodon — mastodon.social →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

3SUM problem solved faster than O(N²) with AI assistance

How we ranked this

Signal score
7 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Tool
The cluster describes a new algorithm for a computational problem and its publication as a preprint. [lever_c_demoted from research: ic=1 ai=0.7]
Source corroboration
Single-source cluster
Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics
paper, other
Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance
High
Clearly on-topic for AI-industry coverage.
Story freshness
Breaking (< 6h)
Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

Full methodology in our editorial standards.

COVERAGE [1]

  1. Mastodon — mastodon.social TIER_1 Русский(RU) · [email protected] ·

    The 3SUM problem is solved faster than O(N²) — namely in O(N¹·⁹⁹⁹²). Neural networks were involved October 5 American researchers Virginia Vassilevska Williams, and

    Задача 3SUM решена быстрее, чем за O(N²) — а именно за O(N¹·⁹⁹⁹²). Без нейронок не обошлось 5 октября американские исследователи Вирджиния Василевска-Уильямс, известная своими быстрыми (и безумно сложными) алгоритмами перемножения матриц за вместо и её бывший аспирант Джош Алман …

    LINKS habr.com/…/1091158

RELATED ENTITIES

RELATED TOPICS