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...
VQV Signal
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...
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...
VQV organizes public signals from inspectable sources. It does not independently verify the underlying report.
Signal Strength reflects source quality, relevance, freshness and evidence. Public Interest helps organize discovery; it is not proof of truth.
Public Interest components
VQV surfaced this signal because it is recent, relevant to AI Search, connected to Scobleizer News Pulse (X).
No login, cookies, social SDKs, or automatic posting.