Complex sentence: In computational complexity theory, the exponential time hypothesis is an unproven computational hardness assumption formalized by stating that 3-SAT (or any of several related NP-complete problems) cannot be solved in subexponential time in the worst case.
Split into simpler sentences: In computational complexity theory, the exponential time hypothesis is an unproven computational hardness assumption that was formulated by. The hypothesis states that 3-SAT (or any of several related NP-complete problems) cannot be solved in subexponential time in the worst case.