Space hierarchy theorem revised.
type: Item
instance of: scholarly article
title: Space hierarchy theorem revised.
zbMATH Open document ID: 1038.68053
DOI: 10.1016/S0304-3975(02)00402-4
author: Viliam Geffert
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1965272
zbMATH Keywords: Computational complexity
zbMATH Keywords: Space complexity
MaRDI profile type: Publication
cites work: On tape bounds for single letter alphabet language processing
cites work: Strong optimal lower bounds for Turing machines that accept nonregular languages
cites work: The alternation hierarchy for sublogarithmic space is infinite
cites work: Space bounded computations: Review and new separation results
cites work: Q4503828
cites work: Space bounds for processing contentless inputs
cites work: Nondeterministic Computations in Sublogarithmic Space and Space Constructibility
cites work: Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space
cites work: A hierarchy that does not collapse : alternations in low level space
cites work: Bridging across the \(\log(n)\) space frontier
cites work: Q5636862
cites work: Some Results on Tape-Bounded Turing Machines
cites work: A Note Concerning Nondeterministic Tape Complexities
cites work: Nondeterministic Space is Closed under Complementation
cites work: The Sublogarithmic Alternating Space World
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: Separating Nondeterministic Time Complexity Classes
cites work: Halting space-bounded computations
cites work: The method of forced enumeration for nondeterministic automata
cites work: Turing machines with sublogarithmic space
cites work: A Turing machine time hierarchy
description: scientific article; zbMATH DE number 1965272