In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, gives a relationship between deterministic and non-deterministic space complexity. It states that for any space-constructable function f ∈ Ω ( log ( n ) ) {\displaystyle f\in \Omega (\log(n))} , N S P A C E ( f ( n ) ) ⊆ D S P A C E ( f ( n ) 2 ) .
In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, gives a relationship between deterministic and non-deterministic space complexity. It states that for any space-constructable function f ∈ Ω ( log ( n ) ) {\displaystyle f\in \Omega (\log(n))} , N S P A C E ( f ( n ) ) ⊆ D S P A C E ( f ( n ) 2 ) .
Source: Wikipedia "Savitch's theorem" · CC BY-SA 4.0
Share this article: X · Bluesky