PP is as hard as the polynomial-time hierarchy (1991)

by S Toda
Venue:SIAM Journal on Computing