Counting classes are at least as hard as the polynomial-time hierarchy

This publication has 19 references indexed in Scilit:

• Randomized polynomials, threshold circuits, and the polynomial hierarchy
  Published by Springer Nature ,2005
• On the power of probabilistic polynomial time: P/sup NP(log)/ contained in PP
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Gap-definable counting classes
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• A survey on counting classes
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Turing machines with few accepting computations and low sets for PP
  Journal of Computer and System Sciences, 1992
• Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
  SIAM Journal on Computing, 1981
• Some connections between nonuniform and uniform complexity classes
  Published by Association for Computing Machinery (ACM) ,1980
• Computational Complexity of Probabilistic Turing Machines
  SIAM Journal on Computing, 1977
• Complete sets and the polynomial-time hierarchy
  Theoretical Computer Science, 1976
• The polynomial-time hierarchy
  Theoretical Computer Science, 1976