1. Agrawal, M.: Pseudo-random generators and structure of complete degrees. In IEEE Conference on Computational Complexity, pp. 139–147 (2002)
2. Agrawal, M., Biswas, S.: Polynomial isomorphism of 1-L complete sets. In: Proc. Structure in Complexity Theory 7th Annual Conference, San Diego, California, pp. 75–80. IEEE Computer Society, Los Alamitos (1993)
3. Allender, E.: Isomorphisms and 1-L reductions. J. Comput. Syst. Sci. 36(6), 336–350 (1988)
4. Allender, E., Buhrman, H., Koucký, M., van Melkebeek, D., Ronneburger, D.: Power from random strings. In: FOCS, pp. 669–678. IEEE Computer Society, Los Alamitos (2002)
5. Lecture Notes in Computer Science;K. Ambos-Spies,1984