Why an AI-disputed ETH matters: subexponential n/√log₂n scaling vs 2ⁿ, huge savings at large n
robleclerc · x · 2026-10-27
Answering "why is ETH being disproven by AI a big deal?", Rob Leclerc points to scaling: the claimed subexponential algorithm (exponent n/√log₂n) diverges massively from 2ⁿ as variable count n grows — an attached chart shows the exponent gap at n=200. The payoff is exponential speedups on large problems, not just pride in a human conjecture falling.
More from Research
- NUS's DynaFlow Learns Free-Form Multi-Agent Orchestration, Beats AFLOW — NationalUniversityofSingapore · 2026-10-27
- Survey Maps Trustworthy Recursive Self-Improvement: Risks, Evaluation, Open Problems — Jiayue Pu · 2026-10-27
- Δτ-Bench: Agents Face a Moving Tool Frontier, Best Model Scores Just 42.3% — UniversityCollegeLondon · 2026-10-27
- ProAS Fixes Uniform Credit Assignment in Critic-Free Agentic RL — LINs-lab · 2026-10-27
- PatEx-Gym: First Agent Benchmark for Patent Examination with 1M+ Patent Corpus — IPIntelligence · 2026-10-27
- AgentProofBench: CMU Benchmarks Reusable Verifiers for Web Agents — CarnegieMellonU · 2026-10-27