Savitch's theorem

From Wikipedia, the free encyclopedia

In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, states that for any function f(n) ≥ log(n)

NSPACE(f(n)) ⊆ DSPACE(f²(n)).

In other words, if a nondeterministic Turing machine can solve a problem using f(n) space, an ordinary deterministic Turing machine can solve the same problem in the square of the space. Although we believe that nondeterminism can speed up time exponentially, this theorem shows that it has a markedly more limited effect on space requirements.

[edit] Proof

The proof of the theorem is constructive: it demonstrates an algorithm for STCON, the problem of determining whether there is a path between two vertices in a directed graph, which runs in log²(n) space for n vertices. Then, it builds a DSPACE machine which runs the algorithm on the computation tree of the corresponding NSPACE machine to determine whether there is a path from the start node to the accept node, and accepts if and only if this is so. As STCON is NL-complete, this demonstrates that all languages in NL are also in L².

[edit] Corollaries

Some important corollaries of the theorem include:

• PSPACE = NPSPACE
  • This follows directly from the fact that the square of a polynomial function is still a polynomial function. A similar relationship is not believed to exist between the polynomial time complexity classes, P and NP, although this is still an open question.
• NL ⊆ L²
  • A direct result of the construction of the proof.

[edit] References

• Michael Sipser (1997). Introduction to the Theory of Computation. PWS Publishing. ISBN 0-534-94728-X.  Section 8.1: Savitch's Theorem, pp.279–281.
• Christos Papadimitriou (1993). Computational Complexity, 1st edition, Addison Wesley. ISBN 0-201-53082-1.  Pages 149–150 of section 7.3: The Reachability Method.