CS theorists debate: October 6 results, incl. Unique Games Conjecture, dwarf the ETH refutation
burny_tech · x · 2026-10-27
A debate among TCS researchers: some call the 2^(n/logn)-time k-SAT algorithm (refuting the Exponential Time Hypothesis) one of the biggest results ever, but others push back — the result wasn't surprising, and ETH mainly served as a useful tool for fine-grained complexity. Bigger results include the Unique Games Conjecture from the October 6 release, plus classics like PSPACE=IP, NP-completeness, and zero-knowledge proofs.
More from Research
- Epilepsy gene discovery jumps 6x: 15.77M variants, 20,979 cases, with DeepMind's Argon model — anshulkundaje · 2026-10-27
- LLM social simulations fail systematically: less diverse, more agreeable, WEIRD-skewed — profjamesevans · 2026-10-27
- Jonathan the 194-Year-Old Tortoise Has Its Genome Sequenced — rand_longevity · 2026-10-27
- Insilico's AI-designed Pan-TEAD inhibitor ISM6331 hits 40% ORR in mesothelioma Phase 1 — rand_longevity · 2026-10-27
- ETH result stuns complexity theorists: what structure could all boolean circuits share? — moultano · 2026-10-27
- Edinburgh team publishes 10 papers on self-play, multimodal retrieval, VLM robustness — PMinervini · 2026-10-27