Complexity-class-encoding sets
type: Item
instance of: scholarly article
title: Complexity-class-encoding sets
zbMATH Open document ID: 0355.68039
DOI: 10.1016/S0022-0000(76)80054-2
published in: Journal of Computer and System Sciences
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D10
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 03D20
zbMATH DE Number: 3553755
author: Nancy Lynch
MaRDI profile type: Publication
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: The complexity of theorem-proving procedures
cites work: Q4082296
cites work: An Overview of the Theory of Computational Complexity
cites work: Q5592246
cites work: Q4142699
cites work: On Reducibility to Complex or Sparse Sets
cites work: A comparison of polynomial time reducibilities
cites work: Classes of computable functions defined by bounds on computation
cites work: Q5573961
cites work: On Sets Cook-Reducible to Sparse Sets
description: scientific article; zbMATH DE number 3553755