Category
page 1Theorems in computational complexity theory
Cook–Levin theorem
theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
master theorem
method for analysis of algorithms
Savitch's theorem
theorem that problems solvable nondeterministically in space S may be solved deterministically in space O(S²)
structured program theorem
theorem that a class of control flow graphs can compute any computable function if it combines subprograms only through sequence, selection, and iteration
No free lunch in search and optimization
theorem
PCP theorem
theorem in complexity theory that every problem in NP has probabilistically checkable proofs
Blum's speedup theorem
theorem about the complexity of computable functions
speedup theorem
Wikimedia disambiguation page
linear speedup theorem
speeding up Turing machines by increasing tape symbol complexity
time hierarchy theorem
theorem
Toda's theorem
theorem
gap theorem
theorem that there are arbitrarily large computable gaps in the hierarchy of complexity classes