1. Reducibility, randomness, and intractibility;Adleman;Proc. 9th Ann. ACM Symp. on Theory of Computing,1977
2. Lower bounds for the low hierarchy;Allender,1989
3. Relativizations of the P=?NP question;Baker;SIAM J. Comput.,1975
4. Sets with small generalized Kolmogorcv complexity;Balcázar;Acta Inform.,1986
5. Sparse sets, lowness and highness;Balcázar;SIAM J. Comput.,1986