1. 1. DLEMAN L. and MANDERS K., Reducibility, randomness, and intractability, Proc. 9th ACM Symp. on Theory of Computing, 1977, pp. 151-163.
2. 2. ALLENDER E., HEMACHANDRA L., OGIWARA M. and WATANABE O., Relating equivalence and reducibility to sparse sets, SIAM Journal on Computing 1992, 21 (3), pp. 529-539.11633440761.68039
3. 3. ARVIND V. HAN Y., HEMACHANDRA L. A., KOBLER J., LOZANO A., MUNDHENK M., OGIWARA M., SCHONING U., SILVESTRI R. and THIERAUF T., Reductions to sets of low information content, In Complexity Theory, Current Research, Cambridge University Press, 1993, pp. 1-45.12553390794.68058
4. 4. ARVIND V., KOBLER J. and MUNDHENK M., On bounded truth-table, conjunctive, and randomized reductions to sparse sets, Proc. 12th Conf. FST & TCS, Lecture Notes in Computer Science, 52, pp. 140-151, Springer Verlag, 1992.12290960919.03034
5. 5. ARVIND V., KOBLER J. and MUNDHENK M., Upper bounds on the complexity of sparse and tally descriptions, Mathematical Systems Theory, to appear.13601970840.68041