1. Agrawal, M., Arvind, V.: Geometric sets of low information content. Theor. Comput. Sci. 158(12), 193–219 (1996)
2. Arvind, V., Han, Y., Hemachandra, L., Köbler, J., Lozano, A., Mundhenk, M., Ogiwara, M., 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)
3. Athreya, K.B., Hitchcock, J.M., Lutz, J.H., Mayordomo, E.: Effective strong dimension in algorithmic information and computational complexity. SIAM J. Comput. 37(3), 671–705 (2007)
4. Fu, B.: With quasilinear queries EXP is not polynomial time Turing reducible to sparse sets. SIAM J. Comput. 24(5), 1082–1090 (1995)
5. Fu, B.: Personal communication (2006)