The polynomial-time hierarchy
type: Item
instance of: scholarly article
title: The polynomial-time hierarchy
zbMATH Open document ID: 0353.02024
DOI: 10.1016/0304-3975(76)90061-X
published in: Theoretical Computer Science
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D55
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 03D40
Mathematics Subject Classification ID: 03D10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3548961
author: Larry J. Stockmeyer
MaRDI profile type: Publication
Wikidata QID: Q55954590
cites work: Solvable cases of the decision problem
cites work: On the computational power of pushdown automata
cites work: Optimization of LR(k) parsers
cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
cites work: The complexity of theorem-proving procedures
cites work: Time bounded random access machines
cites work: Q4058132
cites work: Q5593643
cites work: Q5592246
cites work: Space-bounded reducibility among combinatorial problems
cites work: Q4142699
cites work: Q5573961
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: Q5537599
cites work: Infinite exponent partition relations and well-ordered choice
cites work: Q5636862
cites work: Q3888985
cites work: Q4131648
DBLP publication ID: journals/tcs/Stockmeyer76
description: scientific article; zbMATH DE number 3548961