1. Reducibility, randomness and intractability;Adleman,1977
2. V. Arvind, J. Köbler and M. Mundhenk, Monotonous and randomized reductions to sparse sets, RAIRO Inform. Théor. Appl., to appear.
3. V. Arvind, J. Köbler and M. Mundhenk, Upper bounds on the complexity of sparse and tally descriptions, Math. Systems Theory, to appear.
4. Structural Complexity I/II;Balcázar,1988
5. On languages with very high spacebounded Kolmogorov complexity;Book;SIAM J. Comput.,1993