1 problem

Exponential Time Hypothesis. There is no $2^{o(n)}$-time algorithm for textsc{3-SAT} on $n$-variable instances.