1. C. E. Shannon, “A symbolic analysis of relay and switching circuits,” Trans. AIEE, 57, 713–723 (1938).
2. C. E. Shannon, “The synthesis of two-terminal switching circuits,” Bell Syst. Techn. J., 28, 59-98 (1949).
3. E. A. Lamagna and J. E. Savage, On the Logical Complexity of Symmetric Switching Functions in Monotone and Complete Bases, Tech. Rep. Rhode Island, Brown University (1973).
4. B. M. Kloss and V. A. Malyshev, “Complexity bounds for some classes of functions,” Vestn. MGU, Matem. Mekh. Series, 94, 44–51 (1965).
5. C. P. Schnorr, “A 3n-lower bound on the network complexity of Boolean functions,” Theoretical Computer Science, 10, No. 1, 83–92 (1980).