OpenAI claims subexponential 3SAT bound; Impagliazzo, Paturi, Ryan Williams lead open review
AIFlow_ML · x · 2026-10-27
OpenAI claims a bound for 3SAT on n variables of about exp(n/(log n)^{1/2+o(1)}) time — asymptotically below every 2^(cn), though not polynomial, and the paper itself notes it doesn't make all of NP subexponential. The review is led by Impagliazzo and Paturi (proposers of ETH) plus Ryan Williams. Their letter stresses: "Our involvement should not be taken as certification of the claim." No NDAs, unpaid, raw data public — an unusually transparent review setup.
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