Highly Influenced

# 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} }

- Published 1992 in Theor. Comput. Sci.
DOI:10.1016/0304-3975(92)90084-S

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