Abstract
We introduce a new method to separate counting classes of a special type by oracles. Among the classes, for which this method is applicable, are NP, coNP, US (also called 1-NP), ⊕ P, all other MOD-classes, PP, and C = P, classes of Boolean Hierarchies over the named classes, classes of finite acceptance type, and many more. As an important special case, we completely characterize all relativizable inclusions between classes NP(k) from the Boolean Hierarchy over NP and other classes defined by what we call bounded counting.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received January 1996, and in final form November 1996.
Rights and permissions
About this article
Cite this article
Cronauer, K., Hertrampf, U., Vollmer, H. et al. The Chain Method to Separate Counting Classes. Theory Comput. Systems 31, 93–108 (1998). https://doi.org/10.1007/s002240000080
Published:
Issue Date:
DOI: https://doi.org/10.1007/s002240000080