References
- [1.] Jablonski S. V., Introduction into discrete mathematics, Moscow, Nauka, 1979 (in Russian).
- [2.] Jablonski S. V. and Lupanov O. B., Discrete mathematics and Mathematical Problems of Cybernetics, Nauka, Moscow, 1974, (in Russian), pages 99148.
- [3.] Sapozhenko A. A., Disjunctive Normal Forms, Moscow University Press, Moscow, 1975 (in Russian).
- [4.] Toman E., Haviarova L., Properties of the interval graph of a Boolean function, Acta Mathematica Universitatis, 2013, Vol. LXXXII, 2 (2013), pages 191200.
- [5.] Wegener I., The Complexity of Boolean Functions, New York: Wiley, 1987
- [6.] Fagin R., Klawe M., Pippenger N. and Stockmeyer L., Bounded-depth, polynomial-size circuits for symmetric functions, Theoretical Computer Science, 1985, Vol. 36, pages 239250.
- [7.] Denenberg L., Gurevich Y. and Shelah S., Definability by constant-depth polynomial-size circuits, Information and Control, 1986, Vol. 70(2/3), pages 216240.
- [8.] Canteaut A. and Videau M., IEEE Transactions On Information Theory, Symmetric Boolean Functions, 2005.
- [9.] Graham R., Knuth D., Patashnik O., Concrete Mathematics a Foundation for Computer Science, Addison-Wesley Publishing Company, 1989.
- [10.] Nigmatulin R. G., The Complexity of Boolean Functions, Kazan, University Press, 1983.
- [11.] Toman E., Haviarova L., The Number of Monotone and Self-Dual Boolean Functions, Journal of Applied Mathematics, Statistics and Informatics, 2014, Vol. 10, pages 93-111.