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

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version