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. In Structure in Complexity Theory Conference. pages 2-12, 1991.

Abstract

Abstract is missing.