论文信息 - On Counting Problems and the Polynomial-Time Hierarchy

On Counting Problems and the Polynomial-Time Hierarchy

We consider the relation between the relativized polynomial time hierarchy and relativizations of Gill's class PP of sets recognizable in polynomial time by probabilistic Turing machines and of Valiant's class D≠P of sets polynomial time Turing reducible to functions that give the number of accepting computations of nondeterministic polynomial-time bounded Turing machines. The main result is that there exists an oracle set A such that PPA −(Π2P,A ∪ σ2P,A) ≠ ∅, with the corollary that also D ≠PA − (Π2P,A ∪ σ2P,A ≠ ∅. The proof is an application of Baker and Selman's technique for showing that σ2P,A ⊆ σ3P,A for some oracle set A.

Dana Angluin | D. Angluin

[1] Gary L. Miller,et al. Riemann's Hypothesis and tests for primality , 1975, STOC.

[2] Volker Strassen,et al. Erratum: A Fast Monte-Carlo Test for Primality , 1978, SIAM J. Comput..

[3] Theodore P. Baker,et al. A second step toward the polynomial hierarchy , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

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

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

[6] C. Rackoff. Relativized Questions Involving Probabilistic Algorithms , 1982, JACM.

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

[8] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[9] John T. Gill,et al. Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[10] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[11] Rudolf Mathon,et al. A Note on the Graph Isomorphism counting Problem , 1979, Inf. Process. Lett..

[12] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..