Did prior SOTA algorithms like PPSZ meet the resolution-based lower bound conditions?
minilek · x · 2026-10-29
Follow-up: minilek asks whether prior SOTA SAT algorithms like PPSZ satisfy the conditions of the lower bound against resolution-based methods. Williams replies that extensions of known algorithms were known to obey ETH — e.g. resolution-based methods (which capture most behavior of modern SAT solvers) wouldn't work — though he didn't find those reasons compelling and thought refuting SETH should come before ETH.
More from Research
- Reuters Institute 9-country survey: weekly AI use jumps from 34% to 51% in a year — _FelixSimon_ · 2026-10-29
- Next neural twins will let models control what their partner can read — Sauers_ · 2026-10-29
- Interpretability find: a Talkie neuron makes the model believe it's Walter Scott trapped in his own novel — repligate · 2026-10-29
- Linked AI twins copy each other's test answers — even when the partner is wrong — Sauers_ · 2026-10-29
- Neural twins write with interleaved tokens as one voice while chatting with each other — Sauers_ · 2026-10-29
- Removing one training dataset made the linked 'neural twins' score higher on happiness probes — Sauers_ · 2026-10-29