Does a natural algorithm class capture all known 2^(-εn) subexponential k-SAT algorithms? minilek probes PPSZ's limits
minilek · x · 2026-10-29
Researcher minilek discusses fine-grained complexity (SETH-related) questions with @rrwilliams, asking whether all known (2-eps)^n subexponential algorithms (like PPSZ) can be captured by one broad, natural class of algorithms.
- For some restricted algorithm classes, 2^{o(n)}-time algorithms have been ruled out via class-specific lower bounds.
- It remains unclear whether the best known theoretical algorithms fit into any unified natural class.
- The thread cites a Claude answer the author suspects is wrong; no conclusion yet.
A niche theoretical CS exchange without a settled answer.
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