Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Schaefer T. J., “Complexity of satisfiability problems”, Proc. STOC' 78, ACM, New York, 1978, 216–226 | DOI | MR
[2] Gorshkov S. P., “O slozhnosti raspoznavaniya multiaffinnosti, biyunktivnosti, slaboi polozhitelnosti i slaboi otritsatelnosti bulevykh funktsii”, Obozrenie prikladnoi i promyshlennoi matematiki, 4:2 (1997), 216–237
[3] Gorshkov S. P., “Primenenie teorii $NP$-polnykh zadach dlya otsenki slozhnosti resheniya sistem bulevykh uravnenii”, Obozrenie prikladnoi i promyshlennoi matematiki, 2:3 (1995), 325–398 | MR
[4] Gorshkov S. P., “O peresecheniyakh klassov multiaffinnykh, biyunktivnykh, slabo polozhitelnykh i slabo otritsatelnykh bulevykh funktsii”, Obozrenie prikladnoi i promyshlennoi matematiki, 4:2 (1997), 238–259
[5] Yablonskii S. V., Vvedenie v diskretnuyu matematiku, Nauka, Moskva, 1979 | MR
[6] Marchenkov S. S., Zamknutye klassy bulevykh funktsii, Fizmatlit, Moskva, 2001 | MR | Zbl