Growth orders of circuit complexity Shannon functions over infinite bases / O. M. Kasim-Zade. //Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika. 2013. ? 3. P. 55-57 [Moscow Univ. Math. Bulletin. Vol. 68, N 3, 2013.].
It is shown that any function of one real variable being composition of rational functions with real coefficients, logarithms, and exponents and having an order of growth between n and 2O(n1/2) is an order of growth of the Shannon function for the circuit complexity over a certain infinite basis.
Key words: Boolean function, circuit of functional elements, complexity, Shannon function.