|
|
Publications in Math-Net.Ru
-
The complexity of the representation of multiple-output Boolean functions
Bulletin of Irkutsk State University. Series Mathematics, 16 (2016), 30–42
-
An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli
Bulletin of Irkutsk State University. Series Mathematics, 4:4 (2011), 12–26
-
On complexity of a particular Boolean functions class
Bulletin of Irkutsk State University. Series Mathematics, 3:4 (2010), 2–6
-
Polynomial decomposition of Boolean functions into images of homogeneous operators of nondegenerate functions
Izv. Vyssh. Uchebn. Zaved. Mat., 1996, no. 1, 17–21
-
Decomposition of Boolean functions into the sum of products of subfunctions
Diskr. Mat., 5:3 (1993), 102–104
-
Polynomial decomposition of Boolean functions
Mat. Zametki, 53:2 (1993), 25–29
-
Polynomial expansions of Boolean functions in nondegenerate
functions
Algebra Logika, 30:6 (1991), 631–637
-
To the 70th anniversary of the birth of V. V. Bludov
Bulletin of Irkutsk State University. Series Mathematics, 32 (2020), 124–133
-
To the 90th anniversary of the birth of A. I. Kokorin. Stages of scientific and pedagogical way
Bulletin of Irkutsk State University. Series Mathematics, 29 (2019), 138–154
© , 2024