1. Lecture Notes in Computer Science;~ARVIND V.
2. ~BALC~ZAR J. L. D1AZ J. AND GABARR6 J. 1988 Structural ComplexiO' I. Springer-Verlag ~Berlin Germany. ~BALC~ZAR J. L. D1AZ J. AND GABARR6 J. 1988 Structural ComplexiO' I. Springer-Verlag ~Berlin Germany.
3. ~BALCAZAR J. L. AND SCnON~NG U. 1985. Bi-immune sets for complexity classes. Math. 5?st. ~Theory 18 1-10. ~BALCAZAR J. L. AND SCnON~NG U. 1985. Bi-immune sets for complexity classes. Math. 5?st. ~Theory 18 1-10.
4. ~BERMAN L. 1977. Polynomial reducibilities and complete sets. Ph.D. &ssertanon. Cornell Univ. ~Ithaca N.Y. ~BERMAN L. 1977. Polynomial reducibilities and complete sets. Ph.D. &ssertanon. Cornell Univ. ~Ithaca N.Y.
5. Tally languages and complexity classes;~B K, R;Inf. Contr.,1974