Properties of Symmetric Boolean functions

[1.] Jablonski S. V., Introduction into discrete mathematics, Moscow, Nauka, 1979 (in Russian).Search in Google Scholar

[2.] Jablonski S. V. and Lupanov O. B., Discrete mathematics and Mathematical Problems of Cybernetics, Nauka, Moscow, 1974, (in Russian), pages 99148.Search in Google Scholar

[3.] Sapozhenko A. A., Disjunctive Normal Forms, Moscow University Press, Moscow, 1975 (in Russian).Search in Google Scholar

[4.] Toman E., Haviarova L., Properties of the interval graph of a Boolean function, Acta Mathematica Universitatis, 2013, Vol. LXXXII, 2 (2013), pages 191200.Search in Google Scholar

[5.] Wegener I., The Complexity of Boolean Functions, New York: Wiley, 198710.1007/3-540-18170-9_185Search in Google Scholar

[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.10.1016/0304-3975(85)90045-3Search in Google Scholar

[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.10.1016/S0019-9958(86)80006-7Search in Google Scholar

[8.] Canteaut A. and Videau M., IEEE Transactions On Information Theory, Symmetric Boolean Functions, 2005.10.1109/TIT.2005.851743Search in Google Scholar

[9.] Graham R., Knuth D., Patashnik O., Concrete Mathematics a Foundation for Computer Science, Addison-Wesley Publishing Company, 1989.10.1063/1.4822863Search in Google Scholar

[10.] Nigmatulin R. G., The Complexity of Boolean Functions, Kazan, University Press, 1983.Search in Google Scholar

[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.10.2478/jamsi-2014-0016Search in Google Scholar