论文信息 - A second step toward the polynomial hierarchy

A second step toward the polynomial hierarchy

Some of the questions posed by Baker, Gill, and Solovay [1] are here answered. The principal result is that there exists a recursive oracle for which the relativized polynomial hierarchy exists through the second level; that is, there is a recursive set B such that Σ2P,B ≠ π2P,B. It follows that Σ2P,B ⊂≠ Σ3P,B.

Theodore P. Baker | Alan L. Selman | T. Baker | A. Selman

[1] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[2] S. Kleene. Recursive predicates and quantifiers , 1943 .

[3] Celia Wrathall,et al. Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[4] R. Solovay,et al. Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[5] Albert R. Meyer,et al. The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.