1. Adleman, L.M.: Two theorems on random polynomial time. In: Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, pp. 75–83. IEEE Computer Society Press, Los Alamitos (1978)
2. Balcázar, J.L., Díaz, J., Gabarró, J.: Structural Complexity I. EATCS monographs on theoretical computer science, vol. 11. Springer, Heidelberg (1988)
3. Lecture Notes in Computer Science;S. Homer,1995
4. Kannan, R.: Circuit-size lower bounds and non-reducibility to sparse sets. Information and Control 55, 40–56 (1982)
5. Karp, R., Lipton, R.: Turing machines that take advice. L’Enseignement Mathématique 28, 191–209 (1982)