Counting classes are at least as hard as the polynomial-time hierarchy (1992)

by S Toda, M Ogiwara
Venue:SIAM Journal on Computing