1. Relativizations of the P=?NP question;Baker;SIAM J. Comput.,1975
2. Relative to a random oracle A,PA≠ NPA≠ coNPA with probability 1;Bennett;SIAM J. Comput.,1981
3. L. Berman, On the structure of complete sets, in: Proceedings of the 17th IEEE Symposium on Foundations of Computer Science, IEEE Computer Science Press, Silver Spring, MD, 1976, pp. 76–80.
4. L. Berman, Polynomial reducibilities and complete sets, Ph.D. Thesis, Cornell University, Ithaca, NY, 1977.
5. On isomorphisms and density of NP and other complete sets;Berman;SIAM J. Comput.,1977