|
|
Publications in Math-Net.Ru
-
Properties of Boolean functions with the extremal number of prime implicants
Diskretn. Anal. Issled. Oper., 29:1 (2022), 74–93
-
Connected Boolean functions with a locally extremal number of prime implicants
Diskretn. Anal. Issled. Oper., 28:1 (2021), 68–96
-
On the minimization of Boolean functions for additive complexity measures
Diskretn. Anal. Issled. Oper., 26:3 (2019), 115–140
-
On the complexity of minimizing quasicyclic Boolean functions
Diskretn. Anal. Issled. Oper., 25:3 (2018), 126–151
-
Proof of covering minimality by generalizing the notion of independence
Diskretn. Anal. Issled. Oper., 24:2 (2017), 87–106
-
On the problem of minimizing a single set of Boolean functions
Diskretn. Anal. Issled. Oper., 22:3 (2015), 75–97
-
Minimal complexes of faces of a random Boolean function
Diskretn. Anal. Issled. Oper., 21:5 (2014), 76–94
-
On complexity measures for complexes of faces in the unit cube
Diskretn. Anal. Issled. Oper., 20:6 (2013), 77–94
-
On minimal complexes of faces in the unit cube
Diskretn. Anal. Issled. Oper., 19:3 (2012), 79–99
-
On the relation between the irredundant and minimal complexes of faces in the unit cube
Diskr. Mat., 24:2 (2012), 46–74
-
On kernel and shortest complexes of faces in the unit cube
Diskretn. Anal. Issled. Oper., 18:2 (2011), 75–94
-
On irredundant complexes of faces in the unit cube
Diskr. Mat., 23:1 (2011), 132–158
-
The concept of network modeling of discrete systems
Dokl. Akad. Nauk SSSR, 310:2 (1990), 305–308
-
Maximal cardinality of the shadow of an antichain
Diskr. Mat., 1:4 (1989), 78–85
-
Boolean function minimization in the class of disjunctive normal forms
Itogi Nauki i Tekhniki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., 25 (1987), 68–116
-
The number of minimal disjunctive normal forms
Dokl. Akad. Nauk SSSR, 276:6 (1984), 1335–1339
-
On the number of irredundant disjunctive normal forms
Dokl. Akad. Nauk SSSR, 262:6 (1982), 1329–1332
© , 2024