1. Allender, E., Hemachandra, L.A., Ogiwara, M., Watanabe, O.: Relating equivalence and reducibility to sparse sets. SIAM Journal on Computing 21(3), 521–539 (1992)
2. Angluin, D.: Queries and concept learning. Machine Learning 2(4), 319–342 (1988)
3. Arvind, V., Han, Y., Hemachandra, L., Köbler, J., Lozano, A., Mundhenk, M., Ogiwara, A., Schöning, U., Silvestri, R., Thierauf, T.: Reductions to sets of low information content. In: Ambos-Spies, K., Homer, S., Schöning, U. (eds.) Complexity Theory: Current Research, pp. 1–45. Cambridge University Press, Cambridge (1993)
4. Athreya, K.B., Hitchcock, J.M., Lutz, J.H., Mayordomo, E.: Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing (to appear)
5. Berman, L., Hartmanis, J.: On isomorphism and density of NP and other complete sets. SIAM Journal on Computing 6(2), 305–322 (1977)