Counting classes: Thresholds, parity, mods, and fewness

  • Richard Beigel
  • John Gill
  • Ulrich Hertramp
Conference paper

DOI: 10.1007/3-540-52282-4_31

Part of the Lecture Notes in Computer Science book series (LNCS, volume 415)
Cite this paper as:
Beigel R., Gill J., Hertramp U. (1990) Counting classes: Thresholds, parity, mods, and fewness. In: Choffrut C., Lengauer T. (eds) STACS 90. STACS 1990. Lecture Notes in Computer Science, vol 415. Springer, Berlin, Heidelberg

Abstract

Counting classes are classes of languages defined in terms of the number of accepting computations of non-deterministic polynomial-time Turing machines. Well known examples of counting classes are NP, co-NP, ⊕P, and PP. Every counting class consists of languages in P#P[1], the class of languages computable in polynomial time using a single call to an oracle capable of determining the number of accepting paths of an NP machine.

We perform an in-depth investigation of counting classes defined in terms of thresholds and moduli. We show that the computational power of a threshold machine is a monotone function of the threshold. Then we show that the class MODZkP is at least as large as FewP. Finally, we improve a result of Cai and Hemachandra by showing that recognizing languages in the class Few is as easy as distinguishing uniquely satisfiable formulas from unsatisfiable formulas (or detecting unique solutions, as in [21]).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Richard Beigel
    • 1
  • John Gill
    • 2
  • Ulrich Hertramp
    • 3
  1. 1.Dept. of Computer ScienceNew Haven
  2. 2.Dept. of Electrical EngineeringStanford UniversityStanford
  3. 3.Institut für InformatikUniversität Würzburg, Am HublandWürzburg

Personalised recommendations