Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Schaefer T., “Complexity of satisfiability problems”, Proc. 10 Annu. ACM Symp. Theory Comput. Mach., 1978, 216–226 | MR | Zbl
[2] Gorshkov S.P., “Primenenie teorii NP-polnykh zadach dlya otsenki slozhnosti resheniya sistem bulevykh uravnenii”, Obozr. prikl. i promyshl. matem., 2:3 (1995), 325–398
[3] Gorshkov S.P., Tarasov A.V., Slozhnost resheniya sistem bulevykh uravnenii, Kurs, M., 2017, 192 pp.
[4] Tarasov A.V., “O svoistvakh funktsii, predstavimykh v vide 2-KNF”, Diskretnaya matematika, 13:4 (2001), 99–115 | Zbl
[5] Tarasov A.V., “Nekotorye svoistva grupp inertsii bulevykh biyunktivnykh funktsii i induktivnyi metod generatsii takikh funktsii”, Diskretnaya matematika, 14:2 (2002), 34–47
[6] Balakin G.V., “Grafy dvuchlennykh sistem uravnenii s bulevymi neizvestnymi”, Teoriya veroyatn. i ee primen., 40:2 (1995), 241–259 | MR
[7] Balakin G.V., Nikolskii Yu.B., “Posledovatelnoe primenenie metoda maksimuma pravdopodobiya k resheniyu sistem uravnenii s meshayuschimi parametrami”, Obozr. prikl. i promyshl. matem., 2:3 (1995), 468–476
[8] Balakin G.V., “Vvedenie v teoriyu sluchainykh sistem uravnenii”, Trudy po diskretnoi matematike, 1, 1997, 1–18 | MR | Zbl
[9] Balakin G.V., “Sistemy sluchainykh bulevykh uravnenii so sluchainym vyborom neizvestnykh v kazhdom uravnenii”, Trudy po diskretnoi matematike, 3, 2000, 21–28