Ugol'nikov Aleksandr Borisovich

Publications in Math-Net.Ru

1. Equivalent transformations of formulas in $P_2$
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2009, no. 5,  25–32
2. Complexity of realization for a certain sequence of functions of $4$-valued logic by formulas
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2004, no. 3,  52–55
3. On the complexity of schemes in degenerate bases
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1998, no. 6,  22–26
4. On the complexity of schemes in incomplete bases
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1997, no. 2,  58–61
5. Depth of formulas in some classes of $k$-valued logic
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1991, no. 4,  44–47
6. On the depth and complexity of formulas that realize functions in closed classes
   
   Dokl. Akad. Nauk SSSR, 298:6 (1988),  1341–1344
7. Closed Post classes
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1988, no. 7,  79–88
8. Depth and polynomial equivalence of formulas for closed classes of two-valued logic
   
   Mat. Zametki, 42:4 (1987),  603–612
9. The complexity of realization of Boolean functions by schemes in a basis of median and implication
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1987, no. 4,  76–78
10. On the realization of the Boolean functions from some closed classes by schemes of functional elements in incomplete bases
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1985, no. 3,  87–89
11. Realization of functions from closed classes by schemes of functional elements in a complete basis
    
    Dokl. Akad. Nauk SSSR, 271:1 (1983),  49–51
12. The synthesis of schemes and formulas in incomplete bases
    
    Dokl. Akad. Nauk SSSR, 249:1 (1979),  60–63