Exponential time hypothesis
Category: Computer Science
Status: Queued
The ETH conjectures that 3-SAT requires 2^Ω(n) time. The strong ETH refines this: k-SAT requires Ω((2-ε_k)^n) time with ε_k → 0 as k → ∞.
If true, ETH/SETH provide tight lower bounds for many problems via fine-grained complexity. Refutation would imply major algorithmic breakthroughs.
Sources
Runs
No runs yet — this question is queued.