Classes of bounded counting type and their inclusion relations

  • Ulrich Hertrampf
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 900)

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 C1 from C2?” for arbitrary classes C1 and C2 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.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Ulrich Hertrampf
    • 1
  1. 1.Theoretische InformatikUniversität WürzburgWürzburgGermany

Personalised recommendations