1. Two theorems on random polynomial time;Adleman,1978
2. Relativizations of the P = NP? question;Baker;SIAM J. Comput.,1975
3. Relative to a random oracle A, PA ≠ NPA ≠ co NPA with probability 1;Bennet;SIAM J. Comput.,1981
4. Hartmanis, J., Sewelson, V., and Immerman, N., Sparse sets in NP-P: EXPTIME versus NEXPTIME, in “Proc. 15th STOC,” pp. 382–391.
5. On relativized polynomial hierarchies extending two levels;Heller,1983