1. E. P. Ugryumov, Digital Circuit Technology (BKhV-Peterburg, St. Petersburg, 2004).
2. J. T. Astola and R. S. Stankovich, Fundamentals of Switching Theory and Logic Design (Springer-Verlag, Dordrechht, Netherlands, 2006).
3. T. Sasao and P. Besslich, “On the complexity of mod-2 sum PLA’s,” IEEE Trans. on Comput. 39, 262–266 (1990).
4. V. P. Suprun, “Complexity of Boolean functions in class of canonical polarized polynomials,” Diskret. Mat. 5(2), 111–115 (1993).
5. N. A. Peryazev, “Complexity of Boolean functions in a class of polynomial polarized forms,” Algebra Logika 34, 323–326.