Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Aleksanyan A. A., Diz'yunktivnye normalnye formy nad lineinymi funktsiyami, Erevanskii gos. un-t, Erevan, 1990 | MR
[2] Eherenfeucht E., Karpinski M., The computational complexity of $(\mathrm{XOR}, \mathrm{AND})$-counting problems, Preprint, Univ. Bohn, Bohn, 1989
[3] Mak-Vilyams Dzh., Sloen N., Teoriya kodov, ispravlyayuschikh oshibki, Svyaz, M., 1979
[4] Leontev V. K., Moreno O., “O nulyakh bulevykh polinomov”, Zh. vychisl. matem. i matem. fiz., 38:9 (1998), 1608–1615 | MR
[5] Leontiev V., Moreno O., On the Boolean polynomials, Preprint, Gauss Res. Lab. Univ., Puerto-Rico, San-Juan, 1995
[6] Leontev V. K., “O nekotorykh zadachakh, svyazannykh s bulevymi polinomami”, Zh. vychisl. matem. i matem. fiz., 39:6 (1999), 1045–1054 | MR
[7] Sachkov V. N., Kombinatornye metody diskretnoi matematiki, Nauka, M., 1977
[8] Makdonald I., Simmetricheskie funktsii i mnogochleny Kholla, Mir, M., 1985 | MR