Techniques for separating space complexity classes
type: Item
instance of: scholarly article
title: Techniques for separating space complexity classes
zbMATH Open document ID: 0352.68062
DOI: 10.1016/S0022-0000(77)80041-X
author: Joel I. Seiferas
published in: Journal of Computer and System Sciences
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3548431
MaRDI profile type: Publication
cites work: On Languages Accepted in Polynomial Time
cites work: Tape-bounded Turing acceptors and principal AFLs
cites work: Computational Complexity and the Existence of Complexity Gaps
cites work: The Operator Gap
cites work: A hierarchy for nondeterministic time complexity
cites work: A class of universal linear bounded automata
cites work: Space bounds for processing contentless inputs
cites work: Q5629622
cites work: Some Results on Tape-Bounded Turing Machines
cites work: Q5592246
cites work: A Note Concerning Nondeterministic Tape Complexities
cites work: On two-way multihead automata
cites work: A Hierarchy Theorem for Polynomial-Space Recognition
cites work: Hierarchies of Turing machines with restricted tape alphabet size
cites work: Q5684962
cites work: Classes of Predictably Computable Functions
cites work: Q5573961
cites work: Q5672171
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: Infinite exponent partition relations and well-ordered choice
cites work: Relating refined space complexity classes
cites work: Separating Nondeterministic Time Complexity Classes
cites work: Q5636862
cites work: Q5619818
cites work: Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems
description: scientific article; zbMATH DE number 3548431