Theorists debate whether known SAT algorithms like PPSZ fall under ETH lower bounds
minilek · x · 2026-10-29
Duke professor minilek and complexity theorist Ryan Williams discuss on X whether known-optimal SAT algorithms (e.g. PPSZ) fall inside the restricted algorithm classes for which sub-2^n lower bounds are proven. Williams notes extensions of known algorithms were already known to obey ETH, resolution-based methods (capturing most modern SAT solver behavior) wouldn't work, and he felt SETH needed refuting before tackling ETH.
More from Research
- MIT develops injectable gel that may repair damaged nerves, restoring sensation — CurieuxExplorer · 2026-10-29
- OmniSpectra: a wavelength-native spectral foundation model that skips destructive resampling — Md Khairul Islam · 2026-10-29
- LIMe cuts LLM training compute by 15% with layer-integrated attention memory — ChampionshipLimp1749 · 2026-10-29
- Two curated sites to track Lean: Papers With Lean and Lean Weekly — TZahavy · 2026-10-29
- Cohere Labs Presents 3 Papers at EMNLP 2026 ORACLE Workshop on Culture and Multilinguality — Cohere_Labs · 2026-10-29
- Cohere's Zero-Shot SLAM-ASR Spoken Language Understanding Paper Featured at EMNLP — Cohere_Labs · 2026-10-29