1. S. V. Yablonskii, Introduction to Discrete Mathematics (Vysshaya Shkola, Moscow, 2001) [in Russian].
2. D. Lau, Function Algebras on Finite Sets (Springer-Verlag, Berlin, Heidelberg, 2006).
3. A. B Ugol’nikov, “Depth and Polynomial Equivalence of Formulas for Closed Classes of Two-Valued Logic,” Matem. Zametki 42(4), 603 (1987).
4. S. V. Yablonskii and V. P. Kozyrev, “Mathematical Problems of Cybernetics,” in Information Materials of Scientific Council for Integrated Problem “Cybernetics” Akad. Sci. SSSR (Moscow, 1968), Issue 19 a, pp. 3–15.
5. P. M. Spira, “On Time-Hardware Complexity Tradeoffs for Boolean Functions,” in Proc. 4th Hawai Symposium, on System, Sciences (Western Periodicals Company, North Hollywood, 1971). pp. 525–527.