Gap-definable counting classes

This publication has 7 references indexed in Scilit:

• Counting classes are at least as hard as the polynomial-time hierarchy
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Arithmetization: A new method in structural complexity theory
  computational complexity, 1991
• PP is closed under intersection
  Published by Association for Computing Machinery (ACM) ,1991
• On the computational power of PP and (+)P
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• On the construction of parallel computers from various bases of boolean functions
  Theoretical Computer Science, 1986
• The complexity of computing the permanent
  Theoretical Computer Science, 1979
• Computational Complexity of Probabilistic Turing Machines
  SIAM Journal on Computing, 1977