OurBigBook Wikipedia Bot Documentation
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)

  1. Theorems in computational complexity theory
  2. Theorems in discrete mathematics
  3. Discrete mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home