On the power of parity polynomial time

This publication has 24 references indexed in Scilit:

• Structure of complexity classes: Separations, collapses, and completeness
  Published by Springer Nature ,2005
• Complexity classes without machines: On complete languages for UP
  Theoretical Computer Science, 1988
• Complexity Measures for Public-Key Cryptosystems
  SIAM Journal on Computing, 1988
• Enumerative counting is hard
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
  Published by Association for Computing Machinery (ACM) ,1986
• The complexity of sparse sets in P
  Published by Springer Nature ,1986
• Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
  Theoretical Computer Science, 1985
• BPP and the polynomial hierarchy
  Information Processing Letters, 1983
• On the unique satisfiability problem
  Information and Control, 1982
• 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