Abstract:
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 $2^{O(n^{1/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.