Savitch's Theorem, proved by Walter Savitch in 1970, is a result of computational complexity theory stating that any problem a nondeterministic Turing machine can solve using f(n) space can also be solved by a deterministic Turing machine using space on the order of f(n) squared. It shows nondeterminism can inflate space usage by at most a quadratic factor, in sharp contrast to its apparently much larger effect on running time, and it implies that the complexity classes PSPACE and NPSPACE are equal, one of the few such class equalities known unconditionally.
Facts
StatementFor any space-constructible function f in Omega(log n), NSPACE(f(n)) is contained in DSPACE(f(n)^2). 2 Classification
Statement Form Connections
Has Statement Form
In Branch
Source Savitch's theorem, Wikipedia
In the Other Atlases
Credited To
Also in Computing Atlas: credited with this subject.
Sources
1. Savitch's theorem (Wikipedia)
Wikipedia Savitch's theorem lead paragraph (w-bbfill-psymath4-0926)Quote, Wikipedia Savitch's theorem lead paragraph (w-bbfill-psymath4-0926)
proved by Walter Savitch in 1970
2. Savitch's theorem, Wikipedia
Lead paragraph
for any space-constructible function f ∈ Ω(log(n)), NSPACE(f(n)) ⊆ DSPACE(f(n)²).
In Branch: Computational Complexity Theory, Lead sentence
In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, gives a relationship between deterministi
In Group: Computability and Complexity Theory, Lead section
In computational complexity theory, Savitch's theorem, proved by Walter Savitch
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.