1. O. B. Lupanov, Asymptotic Complexity Estimates of Control Systems (Izd-vo Mosk. Gos. Univ., Moscow, 1984).
2. I. Wegener, ‘‘The complexity of the parity function in unbounded fan-in, unbounded depth circuits,’’ Theor. Comput. Sci. 85, 155–170 (1991). https://doi.org/10.1016/0304-3975(91)90052-4
3. Yu. A. Kombarov, ‘‘Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements,’’ Moscow Univ. Math. Bull. 70, 226–229 (2015). https://doi.org/10.3103/S0027132215050083
4. B. M. Kloss and V. A. Malyshev, ‘‘Estimates of complexity of certain function classes,’’ Vestn. Mosk. Univ., Ser. 1: Mat., Mekh., No. 4, 44–51 (1965).
5. N. P. Red’kin, ‘‘Proof of minimality of some schemes of functional elements,’’ Probl. Kibern. 23, 83–101 (1970).