# Classes of bounded counting type and their inclusion relations

## Abstract

Classes of bounded counting type are a generalization of complexity classes with finite acceptance types. The latter ones are defined via nondeterministic machines whose number of accepting paths up to a certain maximum is responsible for the question of acceptance of the input. For the classes of bounded counting type each computation path may have one of *k* possible results from the set {0,⋯, *k*-1} (*k*≥2), and we count the number of paths having result 1, as well as the number of paths having result 2, etc. Each result (except 0) is counted up to a certain maximum, and the vector formed by these numbers is responsible for the acceptance question.

In this paper we design and prove correctness of an algorithm deciding the question “Is there an oracle separating *C*_{1} from *C*_{2}?” for arbitrary classes *C*_{1} and *C*_{2} of bounded counting type. For the special case of classes of finite acceptance types we can give a direct solution to the separability question, thus solving an open problem from [H94a].

Moreover, we note that a surprising consequence on relativizable closure properties of #P can be obtained from these investigations [H94c].

## Preview

Unable to display preview. Download preview PDF.

### References

- [BCS91]D. P. Bovet, P. Crescenzi, R. Silvestri, Complexity Classes and Sparse Oracles; 6
^{th}*Structure in Complexity Theory Conference*(1991), pp. 102–108.Google Scholar - [BCS92]D. P. Bovet, P. Crescenzi, R. Silvestri, A Uniform Approach to Define Complexity Classes;
*Theoretical Computer Science***104**(1992), pp. 263–283.Google Scholar - [GRS80]R. Graham, B. Rothschild, J. Spencer,
*Ramsey Theory*; John Wiley & Sons (New York, 1980).Google Scholar - [GNW90]T. Gundermann, N. A. Nasser, G. Wechsung, A Survey on Counting Classes; 5
^{th}*Structure in Complexity Theory Conference*(1990), pp. 140–153.Google Scholar - [GW87]T. Gundermann, G. Wechsung, Counting Classes of Finite Acceptance Types;
*Computers and Artificial Intelligence***6**(1987), pp. 395–409.Google Scholar - [H92a]U. Hertrampf, Locally Definable Acceptance Types for Polynomial Time Machines; 9
^{th}*Symposium on Theoretical Aspects of Computer Science*(1992), LNCS 577, pp. 199–207.Google Scholar - [H92b]U. Hertrampf, Locally Definable Acceptance Types — The Three-Valued Case; 1
^{th}*Latin American Symposium on Theoretical Informatics*(1992), LNCS 583, pp. 262–271.Google Scholar - [H94a]U. Hertrampf, Complexity Classes with Finite Acceptance Types; 11
^{th}*Symposium on Theoretical Aspects of Computer Science*(1994), LNCS 775, pp. 543–553.Google Scholar - [H94b]U. Hertrampf, Complexity Classes Defined via
*k*-valued Functions; 9^{th}*Structure in Complexity Theory Conference*(1994), pp. 224–234.Google Scholar - [H94c]U. Hertrampf, On Simple Closure Properties of #P;
*Technical Report No. 90, Universität Würzburg*(1994).Google Scholar - [HLSVW93]U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K. W. Wagner, On the Power of Polynomial Time Bit-Reductions; 8
^{th}*Structure in Complexity Theory Conference*(1993), pp. 200–207.Google Scholar - [HVW94]U. Hertrampf, H. Vollmer, K. W. Wagner, On Balanced vs. Unbalanced Computation Trees;
*Mathematical Systems Theory*, to appear.Google Scholar - [JMT94]B. Jenner, P. McKenzie, D. Thérien, Logspace and Logtime Leaf Languages; 9
^{th}*Structure in Complexity Theory Conference*(1994), pp. 242–254.Google Scholar - [NR93]R. Niedermeyer, P. Rossmanith, Extended Locally Definable Acceptance Types; 10
^{th}*Symposium on Theoretical Aspects of Computer Science*(1993), LNCS 665, pp. 473–483.Google Scholar - [R30]F. P. Ramsey, On a Problem of Formal Logic;
*Proceedings London Math. Society***30**(1930), pp. 264–286.Google Scholar - [V94]O. Verbitsky, Towards the Parallel Repitition Conjecture; 9
^{th}*Structure in Complexity Theory Conference*(1994), pp. 304–307.Google Scholar - [V93]N. K. Vereshchagin, Relativizable and Nonrelativizable Theorems in the Polynomial Theory of Algorithms;
*Izvestija Rossijskoj Akademii Nauk***57**(2) (1993), pp. 51–90.Google Scholar - [W90]K. W. Wagner, personal communication, 1990.Google Scholar