Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
theoretical computer science
|
| gptkbp:hasApplication |
complexity class separation
space-bounded computation |
| https://www.w3.org/2000/01/rdf-schema#label |
Savitch's theorem
|
| gptkbp:implies |
PSPACE = NPSPACE
|
| gptkbp:namedAfter |
gptkb:Walter_Savitch
|
| gptkbp:provenBy |
gptkb:Walter_Savitch
|
| gptkbp:publishedIn |
gptkb:Journal_of_Computer_and_System_Sciences
|
| gptkbp:relatedTo |
gptkb:nondeterministic_Turing_machine
deterministic Turing machine space complexity |
| gptkbp:state |
For any function f(n) ≥ log(n), NSPACE(f(n)) ⊆ DSPACE(f(n)^2)
|
| gptkbp:yearProposed |
1970
|
| gptkbp:bfsParent |
gptkb:PSPACE
|
| gptkbp:bfsLayer |
5
|