Bubeck hails subexponential-time 3SAT algorithm as biggest TCS surprise in 20 years
danintheory · x · 2026-10-27
Sebastien Bubeck calls the subexponential-time 3SAT algorithm (2^{n/log^eps(n)}) "maybe the biggest surprise" in his 20 years following theoretical computer science. It's among three announced discoveries spanning harmonic analysis, complexity theory and quantum field theory; another commenter declares "the exponential time hypothesis is FALSE!"
More from Research
- Ruliobiology: interactive slides grow creatures from tiny cellular automata rules — AjdDavison · 2026-10-27
- OpenAI internal model claims to refute Exponential Time Hypothesis; independent review organized — Singularitarian · 2026-10-27
- Music Lenses: ISMIR paper uses sparse autoencoders for steerable concept-level music retrieval — umpedronosapato · 2026-10-27
- Neuronpedia adds 7M+ neurons for Qwen3-32B, Gemma and Llama 3.3 70B to its interpretability encyclopedia — aryaman2020 · 2026-10-27
- Matthew Green hails stunning new ETH result pending Lean proof validity — matthew_d_green · 2026-10-27
- Heuristic for prediction accuracy: a bimodal probability histogram peaking at 0 and 1 — moultano · 2026-10-27