论文信息 - Complete Sets and the Polynomial-Time Hierarchy - 字舞流文

Complete Sets and the Polynomial-Time Hierarchy

Abstract New proofs of two properties of the polynomial-time hierarchy are given. The classes in the hierarchy are characterized using polynomially bounded quantifiers. Using this result, a sequence of complete sets for the hierarchy is exhibited.

Celia Wrathall | C. Wrathall

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

[2] J. Seiferas. NONDETERMINISTIC TIME AND SPACE COMPLEXITY CLASSES , 1974 .

[3] Sheila A. Greibach,et al. Time- and Tape-Bounded Turing Acceptors and AFLs , 1970, J. Comput. Syst. Sci..

[4] Neil D. Jones,et al. Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[5] N. A. Lynch. RELATIVIZATION OF THE THEORY OF COMPUTATION COMPLEXITY , 1972 .

[6] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

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

[8] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

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

[10] Arnold L. Rosenberg,et al. Thirteenth annual IEEE Symposium on switching and automata theory , 1974 .

[11] Albert R. Meyer,et al. Word problems requiring exponential time(Preliminary Report) , 1973, STOC.