Savitch's theorem
Sign in to savetheorem that problems solvable nondeterministically in space S may be solved deterministically in space O(S²)
In the Vinony graph
Vinony's link graph records 27 inbound references to Savitch's theorem, and connects out to Turing machine, PSPACE and International Standard Book Number.
It sits within the topics Structural complexity theory and Theorems in computational complexity theory.
Vinony links it to 15 Wikipedia language editions.
Wikidata facts
- Instance of
- theorem
- Part of
- list of theorems
- Named after
- Walter Savitch
Show 1 more fact
- maintained by WikiProject
- WikiProject Mathematics
Sources (1)
via Wikidata · CC0
Connections
Turing machine
Entity
PSPACE
Entity
International Standard Book Number
Entity
Python
Entity
digital object identifier
Entity
graph
Entity
recursion
Entity
Cambridge University Press
Entity
P versus NP problem
Entity
computational complexity theory
Entity
NP
Entity
P
Entity
Handle System
Entity
non-deterministic Turing machine
Entity
zbMATH Open
Entity
Christos Papadimitriou
Entity
NL
Entity
local variable
Entity
oracle machine
Entity
L
Entity