Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Cherukhin, Dmitry Yur'evich

Statistics Math-Net.Ru
Total publications: 17
Scientific articles: 17

Number of views:
This page:2051
Abstract pages:3566
Full texts:1568
References:209

http://www.mathnet.ru/eng/person27775
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/642276
https://elibrary.ru/author_items.asp?authorid=209597

Publications in Math-Net.Ru
2011
1. D. Yu. Cherukhin, “Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements”, Diskr. Mat., 23:4 (2011),  39–47  mathnet  mathscinet  elib; Discrete Math. Appl., 21:4 (2011), 499–508  scopus
2009
2. D. Yu. Cherukhin, “The complexity of depth-two information networks”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2009, 1,  16–19  mathnet  mathscinet  zmath
2008
3. D. Yu. Cherukhin, “On complexity of linear operators on the class of circuits of depth 2”, Diskr. Mat., 20:1 (2008),  109–119  mathnet  mathscinet  zmath  elib; Discrete Math. Appl., 18:2 (2008), 143–154  scopus
2006
4. D. Yu. Cherukhin, “On circuits of functional elements of finite depth of branching”, Diskr. Mat., 18:4 (2006),  73–83  mathnet  mathscinet  zmath  elib; Discrete Math. Appl., 16:6 (2006), 577–587  scopus
2005
5. D. Yu. Cherukhin, “On the informational component in the complexity of a shift operator”, Diskretn. Anal. Issled. Oper., Ser. 1, 12:2 (2005),  73–77  mathnet  mathscinet  zmath
6. D. Yu. Cherukhin, “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, 4,  54–56  mathnet  mathscinet  zmath
2003
7. D. Yu. Cherukhin, “On the complexity of unitary transformations”, Diskr. Mat., 15:4 (2003),  113–118  mathnet  mathscinet  zmath; Discrete Math. Appl., 13:6 (2003), 601–606
2002
8. D. Yu. Cherukhin, “On invariant classes of functions that are repetition-free expressible by formulas”, Diskretn. Anal. Issled. Oper., Ser. 1, 9:4 (2002),  57–74  mathnet  mathscinet  zmath
9. D. Yu. Cherukhin, “On the complexity of the realization of products of Boolean functions by formulas”, Diskretn. Anal. Issled. Oper., Ser. 1, 9:1 (2002),  84–94  mathnet  mathscinet  zmath
2001
10. D. Yu. Cherukhin, “On the complexity of realization of powers of Boolean functions by formulas”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:4 (2001),  103–111  mathnet  mathscinet  zmath
11. D. Yu. Cherukhin, “Realization of linear functions by formulas in various bases”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2001, 6,  15–19  mathnet  mathscinet  zmath
2000
12. D. Yu. Cherukhin, “Lower bounds for the formula complexity of symmetric Boolean functions”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:3 (2000),  86–98  mathnet  mathscinet  zmath
13. D. Yu. Cherukhin, “Superquadratic lower bounds for the complexity of formulas in some bases”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:2 (2000),  86–95  mathnet  mathscinet  zmath
14. D. Yu. Cherukhin, “On the complexity of the realization of a linear function by formulas in finite Boolean bases”, Diskr. Mat., 12:1 (2000),  135–144  mathnet  mathscinet  zmath; Discrete Math. Appl., 10:2 (2000), 147–157
15. D. Yu. Cherukhin, “The complexity hierarchy of Boolean bases”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2000, 3,  48–50  mathnet  mathscinet  zmath
1999
16. D. Yu. Cherukhin, “On pre-bad Boolean bases”, Diskr. Mat., 11:2 (1999),  118–160  mathnet  mathscinet  zmath; Discrete Math. Appl., 9:3 (1999), 295–342
1997
17. D. Yu. Cherukhin, “On an infinite sequence of improvable Boolean bases”, Diskretn. Anal. Issled. Oper., Ser. 1, 4:4 (1997),  79–95  mathnet  mathscinet  zmath

Organisations
 
Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022