Buzz grows over claimed subexponential 3SAT and what it would mean for NP problems
burny_tech · x · 2026-10-27
RT of @DupuyTaylor's reaction: if 3SAT has a subexponential algorithm while being NP-complete (every NP problem polynomially reduces to it), that would be huge. This is one of the reactions spreading the OpenAI claimed ETH refutation story.
More from Research
- Researcher argues DoM steering is no more transparent than gradient-based vector selection — johnhewtt · 2026-10-27
- DoM steering working at a localized layer doesn't prove localization is correct — johnhewtt · 2026-10-27
- MPI's Alien Recombination method finds concept blends beyond human cognitive reach — profjamesevans · 2026-10-27
- Podcast: James Evans on why reasoning models simulate societies of thought — profjamesevans · 2026-10-27
- PikasekoHash-256: experimental AVX-512 hash function hits ~24 GB/s on one Zen 5 core — ssh4net · 2026-10-27
- DoM steering success isn't strong evidence for interpretability localization — johnhewtt · 2026-10-27