Common
Savitch's theorem
Relation between deterministic and nondeterministic space complexity
Savitch's theorem
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 )...
Open boosters, collect cards and trade them. Free to play.
Play for free