A simplified proof that the Exponential Time Hypothesis is false
porridgeraisin · hn · 2026-10-27
Shiva Kintali published a paper, "A Simplified Proof of ETH is False," attempting a simplified argument that the Exponential Time Hypothesis fails — which would imply sub-exponential algorithms for NP-complete problems. The bold (and contested) complexity-theory claim is drawing intense scrutiny and debate on Hacker News.
More from Research
- OffensiveCon Tokyo demo: finding iOS 0-days with Muse Spark — dyn___ · 2026-10-27
- Michigan's KIDBench finds LLM child safety varies sharply with age awareness, language, culture — radamihalcea · 2026-10-27
- EdgeRock architecture keeps KV cache at 72 MiB for 256K context, 99.1% smaller than Qwen3.5-4B — alifcoder · 2026-10-27
- 'It's just next-token prediction' is dead: a breakdown of 10 interpretability & AI wellbeing studies — Scorpios22 · 2026-10-27
- Equivariant Music Transformer accepted to ISMIR 2026 with Best Paper Award nomination — umpedronosapato · 2026-10-27
- Deedy shares links to the OpenAI and Claude ETH-refutation documents — deedydas · 2026-10-27