Savitch's theorem

Known as: Savitch theorem

In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, gives a relationship between deterministic and non…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

We study the parameterized space complexity of model-checking first-order logic with a bounded number of variables. By…

2014

The objectives of this project are (1) the design and implementation of a simple " editor " for lines of text, and (2) giving you…

2010

Walter Savitch did seminal work in computational complexity theory, and has made many important contributions. For all his other…

2010

The complexity class PSPACE is one of the most robust concepts in contemporary computer science. Aside from the fact that space…

2009

Isabel Oitavem has introduced a term rewriting system (TRS) which captures the class FPS of polynomial-space computable functions…

2007

Graph reachability problems are fundamental to the study of complexity classes. It is well known that the reachability problem…

2006

Since the 1990s, a new metropoli- tan regionalism has stimulated many reform attempts in the United States to change or in…

2003

Cette note de recherche analyse les origines de la gouvernance urbaine dans le debat scientifique nord-americain puis detaille le…

1991

1982