Impagliazzo–Paturi–Zane's Strong Exponential Time Hypothesis

Let $q$-CNFSAT denote the satisfiability problem for conjunctive normal form formulas whose clauses have at most $q$ literals, and let $n$ be the number of variables in the input formula. Strong Exponential Time Hypothesis. There is no $\epsilon>0$ such that, for every $q\geq 3$, $q$-CNFSAT can be solved in $(2-\epsilon)^n n^{\mathcal{O}(1)}$ time. The hypothesis is a standard basis for fine-grained lower bounds; the source invokes it to prove one of its lower bounds, and no resolution status is given here.