Does co-NP have short interactive proofs?

This publication has 6 references indexed in Scilit:

• A low and a high hierarchy within NP
  Journal of Computer and System Sciences, 1983
• Some observations on the probabilistic algorithms and NP-hard problems
  Information Processing Letters, 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
• Computational Complexity of Probabilistic Turing Machines
  SIAM Journal on Computing, 1977
• The polynomial-time hierarchy
  Theoretical Computer Science, 1976
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
  The Annals of Mathematical Statistics, 1952