1. A note on a theorem by Ladner;Balcazar;Inform. Process. Lett.,1982
2. L. Berman, Polynomial reducibilities and complete sets, Ph.D. thesis, Cornell University, 1977
3. The complexity of theorem-proving procedures;Cook,1971
4. Uniformly hard languages;Downey;Theoret. Comput. Sci.,2003
5. On the structure of polynomial time reducibility;Ladner;J. ACM,1975