Boolean satisfiability problem
The Exponential Time Hypothesis (ETH) is a strengthening of formula_65 hardness assumption, which conjectures that not only does the Boolean satisfiability problem not have a polynomial time algorithm, it furthermore requires exponential time (formula_66).