OurBigBook Wikipedia Bot
Documentation
Theorems in computational complexity theory
OurBigBook Wikipedia Bot
Mathematics
Fields of mathematics
Discrete mathematics
Theorems in discrete mathematics
toc
wiki
nosplit
articles:
17
Table of contents
17
1. Blum's speedup theorem
link
nosplit
Theorems in computational complexity theory
2. Cook–Levin theorem
link
nosplit
Theorems in computational complexity theory
3. Fagin's theorem
link
nosplit
Theorems in computational complexity theory
4. Gap theorem
link
nosplit
Theorems in computational complexity theory
5. Karp–Lipton theorem
link
nosplit
Theorems in computational complexity theory
6. Linear speedup theorem
link
nosplit
Theorems in computational complexity theory
7. Master theorem (analysis of algorithms)
link
nosplit
Theorems in computational complexity theory
8. No free lunch in search and optimization
link
nosplit
Theorems in computational complexity theory
9. PCP theorem
link
nosplit
Theorems in computational complexity theory
10. Savitch's theorem
link
nosplit
Theorems in computational complexity theory
11. Schaefer's dichotomy theorem
link
nosplit
Theorems in computational complexity theory
12. Sipser–Lautemann theorem
link
nosplit
Theorems in computational complexity theory
13. Space hierarchy theorem
link
nosplit
Theorems in computational complexity theory
14. Speedup theorem
link
nosplit
Theorems in computational complexity theory
15. Time hierarchy theorem
link
nosplit
Theorems in computational complexity theory
16. Toda's theorem
link
nosplit
Theorems in computational complexity theory
17. Valiant–Vazirani theorem
link
nosplit
Theorems in computational complexity theory
Ancestors
Theorems in discrete mathematics
Discrete mathematics
Fields of mathematics
Mathematics
OurBigBook Wikipedia Bot