Savitch's theorem proves that PSPACE = NPSPACE.
Why the same theorem doesn't prove that NL = L?
Why Savitch's theorem doesn't prove that NL = L?
1
$\begingroup$
computational-complexity
-
2btw, you ca$n$ also post complexity theory questions on [cs.se]. – 2012-09-26
1 Answers
5
If we have a problem in $\mathsf{NSpace}(f)$, then by Savitch's theorem it is in $\mathsf{DSpace}(f^2)$, i.e. $\mathsf{NSpace}(f) \subseteq \mathsf{DSpace}(f^2)$.
If $f$ is a polynomial, then $f^2$ is a polynomial, so we get $\mathsf{NPSpace} \subseteq \mathsf{PSpace}$.
If $f$ is $\lg n$, then $f^2$ is $\lg^2 n$, therefore we only get $\mathsf{NL} \subseteq \mathsf{DSpace}(\lg^2 n)$, we do not get $\mathsf{NL} \subseteq \mathsf{DSpace}(\lg n) = \mathsf{L}$.
In other words, polynomials are closed under squaring, $O(\lg n)$ is not.