Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy.

Seinosuke Toda Mitsunori Ogiwara Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy. 2-12 1991 Structure in Complexity Theory Conference db/conf/coco/coco91.html#TodaO91