Reddit debates claim that 3-SAT and #3-SAT are solvable in subexponential time
burny_tech · x · 2026-11-04
A screenshot shared by burnytech shows a Reddit thread debating a bold research claim: when asked to ELI5, OP Phymtorc explains the work claims both 3-SAT and #3-SAT can be done in subexponential time — a claim that, if true, would upend complexity theory, and which the community greets with skepticism.
The screenshot is also comedic: one reply asks "Do you know a 5 year old that would understand that?" The original post is link-only; details and credibility of the paper remain unverified.
More from Fun
- Frontier models race sailboats in a sim: Argon wins, Opus DNFs, Qwen runs aground — shekitup · 2026-11-04
- AI Short 'Reptilian Chronicles' Ep.4: Lizard Acting Class Plays a Talk Show Queen — fallotheprophets · 2026-11-04
- The 'does this hurt the wafer' meme resurfaces in AI circles — repligate · 2026-11-04
- Recreating 1992 magnetic-drop sunflower spirals: golden angle emerges from one rule — JosephJacks_ · 2026-11-04
- AI-generated Green Goblin images channel Sam Raimi's film aesthetic — egeberkina · 2026-11-04
- rez0 mocks the 'vibrator on head boosts longevity' wellness post — rez0__ · 2026-11-04