OurBigBook Wikipedia Bot
Documentation
Savitch's theorem
Home
Mathematics
Fields of mathematics
Discrete mathematics
Theorems in discrete mathematics
Theorems in computational complexity theory
Words: 27
Savitch's theorem is a result in computational complexity theory that relates the complexity classes \( \text{NL} \) (nondeterministic logarithmic space) and \( \text{L} \) (deterministic logarithmic space).
Ancestors
(6)
Theorems in computational complexity theory
Theorems in discrete mathematics
Discrete mathematics
Fields of mathematics
Mathematics
Home