Claimed disproof of Exponential Time Hypothesis: subexponential 3SAT algorithm announced
cephaloform · x · 2026-10-27
danintheory announced three new discoveries in harmonic analysis, complexity theory, and QFT; the complexity result is being read as a disproof of the Exponential Time Hypothesis — 3SAT solvable in subexponential time in the worst case. Since ETH implies P≠NP, this would be an "optimistic" result for computation.
Follow-up discussion adds precision: per Ryan Williams, the bound is roughly exp(n/(log n)^{1/2+o(1)}) time for 3SAT on n variables — asymptotically below every 2^(cn), but not polynomial, and the paper itself says it does not make all of NP subexponential. The claim is brand new and awaits community verification.
More from Research
- Why OpenAI's claimed 3-SAT breakthrough would be a big deal, explained — micoolcho · 2026-10-27
- Google's StreamVibe: proactive streaming video agents that track evolving user intent — google · 2026-10-27
- Qwen-Image-PE: two-stage training lifts text-to-image prompts by 7.81 points — Qwen · 2026-10-27
- OPTIC compresses per-layer embeddings 1000x with minimal performance loss — Jiacheng Liu · 2026-10-27
- Ant International and Westlake University release Trajectory2Gym for tool-use agent training — ant-intl · 2026-10-27
- Eight universities propose unified framework for work agents — Zishan Xu · 2026-10-27