Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1994: STACS 94 pp 543–553Cite as

Complexity classes with finite acceptance types

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 775))

Abstract

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.

This research was supported by Deutsche Forschungsgemeinschaft, Grant number Wa 847/1-1, “k-wertige Schaltkreise”. Part of this work was done while the author was an assistant at Universität Trier.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

Download references

Author information

Authors and Affiliations

  1. Theoretische Informatik, Universität Würzburg, Am Exerzierplatz 3, D-97072, Würzburg, Germany

    Ulrich Hertrampf

Authors
  1. Ulrich Hertrampf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Patrice Enjalbert Ernst W. Mayr Klaus W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hertrampf, U. (1994). Complexity classes with finite acceptance types. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_170

Download citation

  • DOI: https://doi.org/10.1007/3-540-57785-8_170

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57785-0

  • Online ISBN: 978-3-540-48332-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation