We show that there exist infinitely many $n \in \mathbb{Z}^+$ such that for any constant $\epsilon > 0$, any deterministic algorithm to solve $k$-\textsf{SAT} for $k \geq 3$ must perform at least $(2^{k-\frac{3}{2}-\epsilon})^{\frac{n}{k+1}}$ operations, where $n$ is the number of variables in the $k$\textsf{-SAT} instance.

翻译：我们证明存在无穷多个$n \in \mathbb{Z}^+$，使得对于任意常数$\epsilon > 0$，任何求解$k \geq 3$的$k$-\textsf{SAT}问题的确定性算法至少需要执行$(2^{k-\frac{3}{2}-\epsilon})^{\frac{n}{k+1}}$次操作，其中$n$是$k$\textsf{-SAT}实例中的变量数。