Query complexity, or why is it difficult to separateNP A ∩coNP A fromP A by random oraclesA?

This publication has 18 references indexed in Scilit:

• A Note on Randomized Polynomial Time
  SIAM Journal on Computing, 1987
• Generic oracles and oracle classes
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• Private coins versus public coins in interactive proof systems
  Published by Association for Computing Machinery (ACM) ,1986
• Trading group theory for randomness
  Published by Association for Computing Machinery (ACM) ,1985
• Quantitative Relativizations of Complexity Classes
  SIAM Journal on Computing, 1984
• Bounded query machines: On NP and PSPACE
  Theoretical Computer Science, 1981
• Parity, circuits, and the polynomial-time hierarchy
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1981
• 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
• Bounded query machines: On NP() and NPQUERY()
  Theoretical Computer Science, 1981
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
  SIAM Journal on Computing, 1975