KnowraSpace complexityLinked fromLinked fromThe 15 pages that link to Space complexity, each with the reason it gives.All 15Broader topic 2Related 9Narrower topic 3Compared with 1In-place algorithmNarrower topic: It provides the asymptotic framework for describing an algorithm as in-place.Savitch's theoremNarrower topic: The theorem bounds memory, not running time, for its deterministic simulation.Immerman–Szelepcsényi theoremNarrower topic: The theorem is a structural result about space-bounded computation, not time bounds.