1. Relativizations of the P = ? NP question;Baker;SIAM J. Comput.,1975
2. Relative to a random oracle A, PA ≠ NPA ≠ co-NPA with probability 1;Bennett;SIAM J. Comput.,1981
3. Bounded query machines: On NP and PSPACE;Book;Theoret. Comput. Sci.,1981
4. Bounded query machines: On NP() and NPQUERY();Book;Theoret. Comput. Sci.,1981
5. Book, R., Long, T., and Selman, A. (in press), Quantitative relativizations of complexity classes, SIAM J. Comput.