Errata for circuit size relative to pseudorandom oracles

In the above-titled paper (see Proc. Fifth Structure in Complexity Theory Conf., 1990, p.268-86) by the present authors it was claimed that two specified separations hold relative to every pspace-random oracle A, and relative to almost every oracle A in ESPACE. It is noted that the proofs given were not correct and that corrected proofs are being published elsewhere. Some further discussion regarding these proofs is presented.<<ETX>>

[1]  Christopher B. Wilson.  Relativized circuit complexity , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[2]  Jack H. Lutz,et al.  Circuit Size Relative to Pseudorandom Oracles , 1993, Theor. Comput. Sci..

[3]  John Gill,et al.  Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

[4]  S.A. Kurtz,et al.  Average dependence and random oracles , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.