S Toda - 30th Annual Symposium on Foundations of Computer …, 1989 - computer.org
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 …