论文信息 - BPP and the Polynomial Hierarchy

BPP and the Polynomial Hierarchy

Abstract BPP is the class of all sets that can be divided by a probabilistic Turing machine with bounded error probability within a polynomial time bound. Sipser (1983) showed that BPP is contained in the polynomial hierarchy of Meyer and Stockmeyer. In this paper it is shown by pure counting arguments that BPP is contained in ΣP2, the second level of the hierarchy.

Clemens Lautemann | C. Lautemann

[1] Ker-I Ko,et al. Some Observations on the Probabilistic Algorithms and NP-hard Problems , 1982, Inf. Process. Lett..

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

[3] John Gill,et al. Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

[4] Michael Sipser,et al. A complexity theoretic approach to randomness , 1983, STOC.

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