Teorema De Savitch
![[This page as RDF]](http://es-la.dbpedia.org/static/dbpedialatam.png)
En teoría de la complejidad computacional, el Teorema de Savitch establece que: NSPACE(f) DSPACE(f) Walter Savitch Como corolario, se tiene que PSPACE = NPSPACE.
| rdfs:comment |
|
| foaf:isPrimaryTopicOf | |
| rdfs:label |
|
| Is foaf:primaryTopic of | |
| dcterms:subject | |
| prov:wasDerivedFrom | |
| dbpedia-owl:wikiPageExternalLink | |
| dbpedia-owl:wikiPageID |
|
| dbpedia-owl:wikiPageLength |
|
| dbpedia-owl:wikiPageOutDegree |
|
| Is dbpedia-owl:wikiPageRedirects of | |
| dbpedia-owl:wikiPageRevisionID |
|
| prop-latam:wikiPageUsesTemplate | |
| dbpedia-owl:wikiPageWikiLink | |
| Is dbpedia-owl:wikiPageWikiLink of |
