Publications in Math-Net.Ru
-
Fine precision estimation of Boolean formulas' complexity in some bases consisting of gates with direct and iterative inputs
University proceedings. Volga region. Physical and mathematical sciences, 2015, no. 2, 16–31
-
On logic algebra formulas' complexity in some complete bases consisting of elements with both direct and iterative inputs
University proceedings. Volga region. Physical and mathematical sciences, 2015, no. 1, 54–67
-
Some features of the synthesis of Boolean formulae over complete bases with direct and iterative variables
Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:3 (2014), 76–83
-
Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth $3$
Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2014, no. 3, 14–19
© , 2026