Space-bounded reducibility among combinatorial problems
type: Item
instance of: scholarly article
title: Space-bounded reducibility among combinatorial problems
zbMATH Open document ID: 0317.02039
DOI: 10.1016/S0022-0000(75)80050-X
author: Neil D. Jones
published in: Journal of Computer and System Sciences
publication date: 1975-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D10
Mathematics Subject Classification ID: 03D99
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3496122
MaRDI profile type: Publication
cites work: Q4138187
cites work: Q4133162
cites work: Q5592246
cites work: Q4041559
cites work: Q4142699
cites work: State Reduction in Incompletely Specified Finite-State Machines
cites work: Theory of Formal Systems. (AM-47)
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: Q4131648
cites work: On tape-bounded complexity classes and multihead finite automata
full work available at URL: s0022-0000(75)80050-x
OpenAlex ID: W1989887898
description: scientific article; zbMATH DE number 3496122