Counting Classes: Thresholds, Parity, Mods, and Fewness

@article{Beigel1992CountingCT,
  title={Counting Classes: Thresholds, Parity, Mods, and Fewness},
  author={Richard Beigel and John Gill},
  journal={Theor. Comput. Sci.},
  year={1992},
  volume={103},
  pages={3-23}
}
Counting classes consist of languages deened in terms of the number of accepting computations of nondeterministic polynomial-time Turing machines. Well known examples of counting classes are NP, co-NP, P, and PP. Every counting class is a subset of P #PP1] , 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. Using closure properties of #P, we systematically develop a complexity theory for… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 29 references

The complexity of combinatorial problems with succinct input representation

  • K. W. Wagner
  • Acta Inf.,
  • 1986
Highly Influential
4 Excerpts

Two remarks on the complexity of counting

  • C. H. Papadimitriou, S. K. Zachos
  • Proceedings of the 6th GI Conference on…
  • 1983
Highly Influential
7 Excerpts

Complexity classes de ned by counting quanti ers

  • J. Tor an
  • J. ACM,
  • 1991
1 Excerpt

Similar Papers

Loading similar papers…