Epic
Exponential time hypothesis
Unproven computational hardness assumption
Exponential time hypothesis
In computational complexity theory, the exponential time hypothesis (ETH) states that satisfiability of 3-CNF Boolean formulas (3-SAT) cannot be solved in subexponential time, 2 o ( n ) {\displaystyle 2^{o(n)}} . More precisely, the usual form of the hypothesis asserts the existence of a number s 3 > 0 {\displaystyle s_{3}>0} such that all algorithms that correctly solve 3-SAT require time at least 2 s 3 n . {\displaystyle 2^{s_{3}n}.} ETH is a computational hardness assumption proposed by Russell Impagliazzo and Ramamohan Paturi in 1999 and elaborated on...
Open boosters, collect cards and trade them. Free to play.
Play for free