|
|
Publications in Math-Net.Ru
-
On complexity of standard forms for multifunctions
Bulletin of Irkutsk State University. Series Mathematics, 22 (2017), 63–70
-
On upper bounds of the complexity of functions over non-prime finite fields in some classes of polarized polynomials
Bulletin of Irkutsk State University. Series Mathematics, 17 (2016), 378–45
-
Генетический алгоритм синтеза дискретных управляющих систем на базе ПЛМ
Intelligent systems. Theory and applications, 20:3 (2016), 151–154
-
Classification and Enumeration of Bases in Clone of All Hyperfunctions on Two-Elements Set
Bulletin of Irkutsk State University. Series Mathematics, 7 (2014), 61–78
-
Genetical algorithm obtaining minimal polynomial representations for multi-valued output Boolean functions
Bulletin of Irkutsk State University. Series Mathematics, 4:4 (2011), 82–86
-
Computational bound on complexity of polynomial representations of Boolean functions
Bulletin of Irkutsk State University. Series Mathematics, 3:4 (2010), 33–43
-
On complexity of a particular Boolean functions class
Bulletin of Irkutsk State University. Series Mathematics, 3:4 (2010), 2–6
© , 2026