Counting classes: Thresholds, parity, mods, and fewness

This publication has 18 references indexed in Scilit:

• Two remarks on the power of counting
  Published by Springer Nature ,2005
• Relativized counting classes: Relations among thresholds, parity, and mods
  Journal of Computer and System Sciences, 1991
• The power of counting
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• Algebraic methods in the theory of lower bounds for Boolean circuit complexity
  Published by Association for Computing Machinery (ACM) ,1987
• On the construction of parallel computers from various bases of boolean functions
  Theoretical Computer Science, 1986
• On the unique satisfiability problem
  Information and Control, 1982
• Relativized Questions Involving Probabilistic Algorithms
  Journal of the ACM, 1982
• Computational Complexity of Probabilistic Turing Machines
  SIAM Journal on Computing, 1977
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
  SIAM Journal on Computing, 1975
• The equivalence problem for regular expressions with squaring requires exponential space
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1972