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. SIAM Journal on Computing, 21(2):316-328, 1992.

Abstract

Abstract is missing.