3.Next

In computational complexity theory, the exponential time hypothesis or ETH is an unproven computational hardness assumption that was formulated by . It states that satisfiability of 3-CNF Boolean formulas (3-SAT) cannot be solved in subexponential time, . More precisely, the usual form of the hypothesis asserts the existence of a number such

3.Next