Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Savitch's theorem · Vinony

🌐English

English Deutsch Español Français Italiano Nederlands Português Türkçe Русский العربية 中文日本語

EntityQ954210· pop 15· linked from 27 articles

Savitch's theorem

theorem that problems solvable nondeterministically in space S may be solved deterministically in space O(S²)

Connections

Categories

Structural complexity theory Theorems in computational complexity theory

Sources

wikipedia.externallinksexternallink

International Standard Book Number

Entity

digital object identifier

Cambridge University Press

P versus NP problem

computational complexity theory

non-deterministic Turing machine

Christos Papadimitriou

Sign in to save

What links here27 pages

complexity class

list of computer scientists

st-connectivity

Juris Hartmanis

computational complexity theory

space complexity

exponential time hypothesis

linear bounded automaton

Immerman–Szelepcsényi theorem

space–time tradeoff

PSPACE-complete

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.64

Entitydist 0.66

Entitydist 0.68

Non-squeezing theorem

Entitydist 0.68

Entitydist 0.68

Entitydist 0.69

Entitydist 0.69

Entitydist 0.70

Fooled by Randomness

Entitydist 0.70

Entitydist 0.70

Entitydist 0.70

Entitydist 0.70