1. V. K. Beloshapka, “Decomposition of Functions of Finite Analytical Complexity”, J. Sib. Fed. Univ. Math. Phys., 11:6 (2018), 680–685.
2. V. K. Beloshapka, “On the Complextity of the Differential-Algebraic Description of Analytic Complexity Classes”, Math. Notes, 105:3 (2019), 309–315.
3. V. Yaschenko, N. Varnovskii, Yu. Nesterenko, G. Kabatyansky, P. Gyrdymov, A. Zubov, A. Zyazin, and V. Ovchinnikov, Cryptography: an Introduction, American Mathematical Society, Providence, RI, 2002.
4. A. N. Kolmogorov, “Three Approaches to the Definition of the Concept “Quantity of Information””, Probl. Peredachi Inf., 1:1 (1965), 3–11.
5. L. Blum, M. Shub, and S. Smale, “On a Theory of Computation and Complexity Over the Real Numbers: NP-Completeness, Recursive Functions and Universal Machines”, Bull. Amer. Math. Soc. New Ser., 21:1 (1989), 1–46.