1 problem

Exponential Time Hypothesis. There is no $2^{o(n)}$-time algorithm which can determine whether a given 3SAT formula on $n$ variables is satisfiable.