Subject
Applied Mathematics,Industrial and Manufacturing Engineering
Reference11 articles.
1. O. A. Logachev, A. A. Salnikov, S. V. Smyshlyaev, and V. V. Yaschenko,
Boolean Functions in the Theory of Coding and
Cryptology (MTsNMO, Moscow, 2012) [in Russian].
2. E. Dawson and C.-K. Wu, “On the linear structure of symmetric Boolean
functions,” Australas. J. Combinatorics 16, 239–243
(1997).
3. V. K. Leont’ev, “Certain problems associated with Boolean polynomials,”
Comput. Math. Math. Phys. 39 (6), 1006–1015
(1999).
4. S. N. Selezneva, “On the complexity of recognizing the completeness of sets of
Boolean functions realized by Zhegalkin polynomials,” Discrete Math. Appl. 7 (6), 565–572 (1997).
5. S. N. Selezneva, “A polynomial algorithm for the recognition of belonging
a function of $$
k
$$-valued logic realized by a polynomial to precomplete classes of self-dual
functions,” Discrete Math. Appl. 8 (5), 483–492
(1998).