1. O. B. Lupanov, Asymptotic Estimates fo r the Complexity o f Control Systems (Izd-vo M G U, Moscow, 1984) [in Russian].
2. V. M. Khrapchenko, “The Complexity of the Realization of Symmetrical Functions by Formulae,” Matem. Zametki 11 (1), 109 (1972).[Math. Notes 11, 70 (1972)].
3. V. M. Khrapchenko, “Some Estimates of Multiplication Time,” in Problems of Cybernetics, Issue 33 (Nauka, Moscow, 1978), pp. 221–227.
4. M. Paterson, N. Pippenger, and U. Zwick, “Optimal Carry Save Networks,” in London Math. Soc. Led. Notes Ser. Vol. 169: Boolean Function Complexity. (Cambridge Univ. Press, Cambridge, 1992), pp. 174–201.
5. I. S. Sergeev, “Upper Bounds for the Formula Size of Symmetric Boolean Functions,” Izv. Vyzov. Matem., No. 5, 38 (2014). [Russian Math. 58 (5), 30 (2014)].