Baker, Theodore P.; Selman, Alan L. A second step toward the polynomial hierarchy. (English) Zbl 0397.03023 Theor. Comput. Sci. 8, 177-187 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 28 Documents MSC: 03D15 Complexity of computation (including implicit computational complexity) 68Q05 Models of computation (Turing machines, etc.) (MSC2010) 03D55 Hierarchies of computability and definability 68Q25 Analysis of algorithms and problem complexity Keywords:Computational Complexity; Polynomial Hierarchy; Recursive Oracle Citations:Zbl 0323.68033 PDFBibTeX XMLCite \textit{T. P. Baker} and \textit{A. L. Selman}, Theor. Comput. Sci. 8, 177--187 (1979; Zbl 0397.03023) Full Text: DOI References: [1] Baker, T. P.; Gill, J.; Solovay, R., Relativizations of the \(P\)=? NP question, SIAM J. Comput., 4, 431-444 (1975) [2] Kleene, S. C., Recursive predicates and quantifiers, Trans. Am. Math. Soc., 53, 41-73 (1943) · Zbl 0063.03259 [3] Meyer, A. R.; Stockmeyer, L. J., The equivalence problem for regular expressions with squaring requires exponential space, Proc. 13th IEEE Symp. Switch. Autom. Theory, 125-129 (1972) [4] Stockmeyer, L. J., The polynomial-time hierarchy, Theoret. Comput. Sci., 3, 1-22 (1976) · Zbl 0353.02024 [5] Wrathall, C., Complete sets and the polynomial hierarchy, Theoret. Comput. Sci., 3, 23-33 (1976) · Zbl 0366.02031 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.