1. Allender, E., Buhrman, H., Koucký, M.: What can be efficiently reduced to the Kolmogorov-random strings? Annals of Pure and Applied Logic 138, 2–19 (2006)
2. Allender, E., Buhrman, H., Koucký, M., van Melkebeek, D., Ronneburger, D.: Power from random strings. SIAM Journal on Computing 35, 1467–1493 (2006)
3. Allender, E., Davie, G., Friedman, L., Hopkins, S.B., Tzameret, I.: Kolmogorov complexity, circuits, and the strength of formal theories of arithmetic. Tech. Rep. TR12-028, Electronic Colloquium on Computational Complexity (submitted for publication, 2012)
4. Lecture Notes in Computer Science;E. Allender,2011
5. Arora, S., Barak, B.: Computational Complexity, a modern approach. Cambridge University Press (2009)