Kasim-zade Oktai Muradovich

Publications in Math-Net.Ru

1. Orders of growth of Shannon functions for circuit complexity over infinite bases
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2013, no. 3,  55–57
2. Depth of Boolean functions realized by circuits over an arbitrary infinite basis
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2012, no. 6,  55–57
3. On the depth of Boolean functions over an arbitrary infinite basis
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 14:1 (2007),  45–69
4. Implicit completeness in the $k$-valued logic
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2007, no. 3,  9–13
5. The depth of Boolean functions realized by circuits over an arbitrary basis
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2007, no. 1,  18–21
6. On a method for obtaining bounds for the complexity of schemes over an arbitrary infinite basis
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 11:2 (2004),  41–65
7. Behavior of Shannon functions for complexity of parametric representations of Boolean functions
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2001, no. 3,  66–68
8. Minimal coverings of a Boolean cube by centered antichains
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 4:3 (1997),  9–17
9. On the complexity of schemes of unit resistances, and some properties of Fibonacci numbers
   
   Trudy Mat. Inst. Steklova, 218 (1997),  233–247
10. General upper bound of circuit complexity in an arbitrary infinite complete base
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1997, no. 4,  59–61
11. Implicit expressibility in two-valued logic and crypto-isomorphisms of two-element algebras
    
    Dokl. Akad. Nauk, 348:3 (1996),  299–301
12. On the synthesis of networks composed of functional elements
    
    Dokl. Akad. Nauk, 348:2 (1996),  159–161
13. On the complexity of the realization of Boolean functions by circuits in an infinite basis
    
    Diskretn. Anal. Issled. Oper., 2:1 (1995),  7–20
14. On classes of Boolean functions, invariant with respect to substitution of a single-variable function
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1995, no. 3,  79–82
15. On the implicit expressibility of Boolean functions
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1995, no. 2,  44–49
16. On the complexity of circuits in an infinite basis
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1994, no. 6,  40–44
17. On a measure of the complexity of schemes of functional elements
    
    Dokl. Akad. Nauk SSSR, 250:4 (1980),  797–800


18. Валентин Федорович Колчин (1934–2016)
    
    Diskr. Mat., 28:4 (2016),  3–5
19. The XVII International Conference “Problems of Theoretical Cybernetics”
    
    Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:3 (2014),  5–6
20. Yurii Vasil'evich Prokhorov (on the occasion of his eightieth birthday)
    
    Diskr. Mat., 22:1 (2010),  3–4
21. The XV International Conference “Problems of Theoretical Cybernetics”
    
    Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009),  5–6