1. A. E. Andreev, Complexity of Nondeterministic Functions (BRICS Report Series, no. RS-94-2, February 1994).
2. A. E. Andreev, A. E. F. Clementi, and J. D. P. Rolim, “Hitting Sets Derandomize BPP,” in Lecture Notes on Computer Sciences, Vol. 1099: Automata, Languages and Programming: 23rd International Colloquium (Paderborn, Germany, 1996) (Springer, Berlin, 1996), pp. 357–368.
3. M. M. Bongard, “On a Concept of Useful Information,” Problemy Kibernetiki No. 9, 71–102 (1963).
4. R. G. Gallager, Information Theory and Reliable Communication (Wiley, New York, 1968).
5. A. N. Kolmogorov, Algorithms, Information, and Complexity (Znanie, Moscow, 1991) [in Russian].