Title :
On the computational power of PP and ⊕P
Author_Institution :
Dept. of Comput. Sci. & Inf. Math., Univ. of Electro-Commun., Tokyo, Japan
fDate :
30 Oct-1 Nov 1989
Abstract :
Two complexity classes, PP and ⊕P, are compared with PH (the polynomial-time hierarchy). The main results are as follows: (1) every set in PH is reducible in a certain sense to a set in PP, an (2) every set in PH is reducible to a set in ⊕P under randomized polynomial-time reducibility with two-sided bounded error probability. It follows from these results that neither PP nor ⊕P is a subset of or equivalent to PH unless PH collapses to a finite level. This is strong evidence that both classes are strictly harder than PH
Keywords :
automata theory; computational complexity; equivalence classes; ⊕P; PH; PP; complexity classes; polynomial-time hierarchy; probabilistic Turing machine; randomized polynomial-time reducibility; two-sided bounded error probability; Computational complexity; Computer science; Error probability; Mathematics; Out of order; Polynomials; Turing machines;
Conference_Titel :
Foundations of Computer Science, 1989., 30th Annual Symposium on
Conference_Location :
Research Triangle Park, NC
Print_ISBN :
0-8186-1982-1
DOI :
10.1109/SFCS.1989.63527
