|
|
|
Publications in Math-Net.Ru |
Citations |
|
2015 |
| 1. |
S. A. Lozhkin, V. A. Konovodov, “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  |
| 2. |
S. A. Lozhkin, V. A. Konovodov, “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 |
1
|
|
2014 |
| 3. |
V. A. Konovodov, “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 |
2
|
| 4. |
S. A. Lozhkin, V. A. Konovodov, “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  ; Moscow University Mathematics Bulletin, 69:3 (2014), 100–105  |
1
|
|
| Organisations |
|
|
