Eric Jang on P vs NP: the interesting frontier lies between subexponential 3-SAT and P!=NP
ericjang11 · x · 2026-10-27
Responding to @gdb's take that P probably still doesn't equal NP, Eric Jang argues that's the wrong question: the interesting territory lies between subexponential-time 3-SAT and P!=NP, where polynomial-time methods could yield meaningful average-case bounds on approximation error.
Related event: Brockman on AI math hype: P probably still doesn't equal NP(6 posts)→
More from Research
- MiRL: error-targeted RL cuts terminal agent misbehaviors 43-57% — _akhaliq · 2026-10-28
- Xplore launches RWE-Bench: physics-verified RL training tasks for engineering — Jsevillamol · 2026-10-28
- After42: experts rate 45 of 135 AI-proposed research questions genuinely interesting — james_y_zou · 2026-10-28
- TraceTrial-Bench separates agent success from harness reliability: 31.1% of runs mislead — _akhaliq · 2026-10-28
- Robot learns new task from a single demo: Machenta unveils Vision-Demo-Action foundation model — Ed__Johns · 2026-10-28
- Carbon-X hits frontier-level DNA understanding: Qwen3-14B finetune scores 66.7%, near GPT-6.1 — lvwerra · 2026-10-28