1. Ajtai, M.: Approximate counting with uniform constant-depth circuits. In: Advances in Computational Complexity Theory, pp. 1–20. American Mathematical Society, Providence (1993)
2. Fortnow, L., Hitchcock, J., Pavan, A., Vinodchandran, N.V., Wang, F.: Extracting Kolmogorov complexity with applications to dimension zero-one laws. Information and Computation 209(4), 627–636 (2011); Preliminary version appeared in Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming. LNCS, vol. 4051, pp. 335–345 (2006)
3. Hitchcock, J., Pavan, A., Vinodchandran, N.: Kolmogorov complexity in randomness extraction. Electronic Colloquium on Computational Complexity (ECCC) 16, 71 (2009)
4. Lecture Notes in Computer Science;D. Musatov,2011
5. Nisan, N., Wigderson, A.: Hardness vs. Randomness. Journal of Computer and System Sciences 49(2), 149–167 (1994)