Complexity classes with finite acceptance types
Complexity classes with finite acceptance types are those classes that can be obtained by nondeterministic machines, if the global acceptance condition is of the form: the number of accepting computation paths is in the set A, for some fixed finite set A. We study the relationships between such classes, exhibiting conditions, under which one class is contained in another one relative to all oracles, or conversely there is an oracle seperation. The proof technique uses a key lemma which transforms the inclusionship question for these classes into an existence question for certain hypergraphs.
Unable to display preview. Download preview PDF.
- 1.D. P. Bovet, P. Crescenzi, R. Silvestri, Complexity classes and sparse oracles; 6th Structure in Complexity Theory Conference (1991), pp. 102–108.Google Scholar
- 2.D. P. Bovet, P. Crescenzi, R. Silvestri, A uniform approach to define complexity classes; Theoretical Computer Science104 (1992), pp. 263–283.Google Scholar
- 3.T. Gundermann, G. Wechsung, Counting Classes of finite acceptance types; Computers and Artificial Intelligence6 (1987), pp. 395–409.Google Scholar
- 4.T. Gundermann, N. A. Nasser, G. Wechsung, A survey on counting classes; 5th Structure in Complexity Theory Conference (1990), pp. 140–153.Google Scholar
- 5.U. Hertrampf, Locally definable acceptance types for polynomial time machines; 9th Symposium on Theoretical Aspects of Computer Science (1992), LNCS 577, pp. 199–207.Google Scholar
- 6.U. Hertrampf, Locally definable acceptance types — the three-valued case; 1st Latin American Symposium on Theoretical Informatics (1992), LNCS 583, pp. 262–271.Google Scholar
- 7.U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K. W. Wagner, On the power of polynomial time bit-reductions; 8th Structure in Complexity Theory Conference (1993), pp. 200–207.Google Scholar