Cherukhin Dmitry Yur'evich

Publications in Math-Net.Ru

1. Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
   
   Diskr. Mat., 23:4 (2011),  39–47
2. The complexity of depth-two information networks
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2009, no. 1,  16–19
3. On complexity of linear operators on the class of circuits of depth 2
   
   Diskr. Mat., 20:1 (2008),  109–119
4. On circuits of functional elements of finite depth of branching
   
   Diskr. Mat., 18:4 (2006),  73–83
5. On the informational component in the complexity of a shift operator
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 12:2 (2005),  73–77
6. The lower estimate of complexity in the class of schemes of depth $2$ without restrictions on a basis
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2005, no. 4,  54–56
7. On the complexity of unitary transformations
   
   Diskr. Mat., 15:4 (2003),  113–118
8. On invariant classes of functions that are repetition-free expressible by formulas
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 9:4 (2002),  57–74
9. On the complexity of the realization of products of Boolean functions by formulas
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 9:1 (2002),  84–94
10. On the complexity of realization of powers of Boolean functions by formulas
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:4 (2001),  103–111
11. Realization of linear functions by formulas in various bases
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2001, no. 6,  15–19
12. Lower bounds for the formula complexity of symmetric Boolean functions
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:3 (2000),  86–98
13. Superquadratic lower bounds for the complexity of formulas in some bases
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:2 (2000),  86–95
14. On the complexity of the realization of a linear function by formulas in finite Boolean bases
    
    Diskr. Mat., 12:1 (2000),  135–144
15. The complexity hierarchy of Boolean bases
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2000, no. 3,  48–50
16. On pre-bad Boolean bases
    
    Diskr. Mat., 11:2 (1999),  118–160
17. On an infinite sequence of improvable Boolean bases
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 4:4 (1997),  79–95