Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Kombarov, Yurii Anatol'evich
Statistics Math-Net.Ru
Total publications: 10
Scientific articles: 10

Number of views:
This page:527
Abstract pages:2636
Full texts:1060
References:297
Candidate of physico-mathematical sciences
E-mail:

https://www.mathnet.ru/eng/person73596
List of publications on Google Scholar
List of publications on ZentralBlatt

Publications in Math-Net.Ru Citations
2021
1. Yu. A. Kombarov, “Lower bound of circuit complexity of parity function in a basis of unbounded fan-in”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2021, no. 6,  48–51  mathnet  mathscinet  zmath; Moscow University Mathematics Bulletin, 76:6 (2021), 266–270
2018
2. Yu. A. Kombarov, “A circuit of depth two with limited input branching for voting function”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2018, no. 5,  58–60  mathnet  mathscinet  zmath; Moscow University Mathematics Bulletin, Moscow University Måchanics Bulletin, 73:5 (2018), 196–198  isi  scopus 1
2015
3. Yu. A. Kombarov, “Complexity of implementation of parity functions in the implication–negation basis”, Diskr. Mat., 27:1 (2015),  73–97  mathnet  mathscinet  elib; Discrete Math. Appl., 25:4 (2015), 211–231  isi  scopus
4. Yu. A. Kombarov, “Complexity and structure of circuits for parity functions”, Fundam. Prikl. Mat., 20:6 (2015),  147–153  mathnet; J. Math. Sci., 233:1 (2018), 95–99
5. Yu. A. Kombarov, “Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2015, no. 5,  47–50  mathnet  mathscinet; Moscow University Mathematics Bulletin, 70:5 (2015), 226–229  isi  scopus 1
2013
6. Yu. A. Kombarov, “On minimal circuts in Sheffer basis for linear Boolean functions”, Diskretn. Anal. Issled. Oper., 20:4 (2013),  65–87  mathnet  mathscinet 4
7. Yu. A. Kombarov, “On minimal circuits for linear functions over some bases”, Diskr. Mat., 25:1 (2013),  33–44  mathnet  mathscinet  elib; Discrete Math. Appl., 23:1 (2013), 39–51  scopus 1
8. Yu. A. Kombarov, “Complexity of realization of a linear Boolean function in Sheffer's basis”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2013, no. 2,  49–53  mathnet; Moscow University Mathematics Bulletin, 68:2 (2013), 114–117  scopus 3
2012
9. Yu. A. Kombarov, “On minimal realizations of linear Boolean functions”, Diskretn. Anal. Issled. Oper., 19:3 (2012),  39–57  mathnet  mathscinet 5
2011
10. Yu. A. Kombarov, “The minimal circuits for linear Boolean functions”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2011, no. 6,  41–44  mathnet  mathscinet  zmath 2

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