VQV Signal

RESEARCH WATCH TECHNICAL

Claude-found algorithm breaks the 3SUM and all-pairs shortest paths barriers

A Columbia and MIT paper reports that Claude found a method giving 3SUM in O(n^1.9992) time and all-pairs shortest paths in O(n^2.9995), tiny gains that refute two long-standing hardness hypotheses; per the summary, it came from one session with no human i...

Source: Scobleizer News Pulse (X) · x.com Found via Robert Scoble’s Scobleizer News Pulse · a post on X, not independently verified Published 2026-11-21T21:15:00+00:00 Detected 2026-11-22T01:06:05+00:00
View original source

A Columbia and MIT paper reports that Claude found a method giving 3SUM in O(n^1.9992) time and all-pairs shortest paths in O(n^2.9995), tiny gains that refute two long-standing hardness hypotheses; per the summary, it came from one session with no human i...

A Columbia and MIT paper reports that Claude found a method giving 3SUM in O(n^1.9992) time and all-pairs shortest paths in O(n^2.9995), tiny gains that refute two long-standing hardness hypotheses; per the summary, it came from one session with no human input and was checked in Lean 4. Coming right after the...

Signal Strength 95% Technical label WATCH Public Interest 21 Category RESEARCH Reader Depth TECHNICAL

Signal Strength reflects source quality, relevance, freshness and evidence. Public Interest helps organize discovery; it is not proof of truth.

Public Interest components
Recognizable Entity Score 0 Practical Impact Score 0 Novelty Interest Score 70 Consequence Score 18 Curiosity Score 0 Shareability Score 41

VQV surfaced this signal because it is recent, relevant to AI Search, connected to Scobleizer News Pulse (X).