RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Kochergin, Vadim Vasil'evich

Total publications: 38 (38)
in MathSciNet: 21 (21)
in zbMATH: 19 (19)
in Web of Science: 6 (6)
in Scopus: 15 (15)
Cited articles: 16
Citations in Math-Net.Ru: 46
Citations in Web of Science: 3
Citations in Scopus: 5
Presentations: 2

Number of views:
This page:1260
Abstract pages:3352
Full texts:1037
References:330
Kochergin, Vadim Vasil'evich
Professor
Doctor of physico-mathematical sciences (2008)
Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
E-mail:

http://www.mathnet.ru/eng/person27798
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/312064

Full list of publications:
| scientific publications | by years | by types | by times cited in WoS | by times cited in Scopus | common list |



   2019
1. V. V. Kochergin, A. V. Mikhailovich, “Exact Value of the Nonmonotone Complexity of Boolean Functions”, Math. Notes, 105:1 (2019), 28–35  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib  scopus  scopus
2. V. V. Kochergin, “A simple proof for the upper bound of the computational complexity of three monomials in three variables”, Moscow University Mathematics Bulletin, 74:2 (2019), 43–48  mathnet  crossref  mathscinet  zmath  isi  scopus  scopus

   2018
3. V. V. Kochergin, A. V. Mikhailovich, “On the complexity of multivalued logic functions over some infinite basis”, J. Appl. Industr. Math., 12:1 (2018), 40–58  mathnet  crossref  crossref  elib  elib  scopus  scopus

   2017
4. V. V. Kochergin, “Asymptotics of growth for non-monotone complexity of multi-valued logic function systems”, Sib. elektron. matem. izv., 14 (2017), 1100–1107  mathnet  crossref  isi
5. V. V. Kochergin, D. V. Kochergin, “Improvement of the lower bound for the complexity of exponentiation”, Prikl. Diskr. Mat., 2017, no. 38, 119–132  mathnet  crossref  elib
6. V. V. Kochergin, A. V. Mikhailovich, “The minimum number of negations in circuits for systems of multi-valued functions”, Discrete Math. Appl., 27:5 (2017), 295–302  mathnet  crossref  crossref  mathscinet  mathscinet  isi (cited: 2)  elib  elib  elib  scopus  scopus

   2016
7. V. V. Kochergin, D. V. Kochergin, “Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits”, Moscow University Mathematics Bulletin, 71:2, March (2016), 55–60  mathnet  crossref  mathscinet  zmath  isi (cited: 1)  elib  elib  scopus (cited: 1)  scopus (cited: 1)
8. V. V. Kochergin, “Ob odnoi zadache O. B. Lupanova”, Materialy XII Mezhdunarodnogo seminara «Diskretnaya matematika i ee prilozheniya» imeni akademika O. B. Lupanova (Moskva, MGU, 20–25 iyunya 2016 g.), Izd-vo mekhaniko-matematicheskogo fakulteta MGU, Moskva, 2016, 4–17
9. V. V. Kochergin, A. V. Mikhailovich, “O nemonotonnoi slozhnosti funktsii $k$-znachnoi logiki”, Materialy XII Mezhdunarodnogo seminara «Diskretnaya matematika i ee prilozheniya» imeni akademika O. B. Lupanova (Moskva, MGU, 20–25 iyunya 2016 g.), Izd-vo mekhaniko-matematicheskogo fakulteta MGU, Moskva, 2016, 142–145

   2017
10. Vadim V. Kochergin, “On some measures of complexity of finite Abelian groups”, Discrete Mathematics and Applications, 27:2 (2017), 81–95  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib  scopus

   2015
11. V. V. Kochergin, A. V. Mikhailovich, “On the complexity of circuits in bases containing monotone elements with zero weights”, Prikl. Diskr. Mat., 2015, no. 4(30), 24–31  mathnet  crossref  elib

   2018
12. V. V. Kochergin, “On Bellman's and Knuth's problems and their generalizations”, J. Math. Sci., 233:1 (2018), 103–124  mathnet  crossref

   2015
13. V. V. Kochergin, A. V. Mikhailovich, Some extensions of the inversion complexity of Boolean functions, 2015 (Published online) , 5 pp., arXiv: arXiv:1506.04485  zmath
14. V. V. Kochergin, A. V. Mikhailovich, Inversion complexity of functions of multi-valued logic, 2015 (Published online) , 11 pp., arXiv: arXiv:1510.05942  zmath
15. V. V. Kochergin, “Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman's and Knuth's problems”, Journal of Applied and Industrial Mathematics, 9:1 (2015), 68–82  mathnet  crossref  mathscinet  elib  scopus (cited: 3)

   2013
16. V. V. Kochergin, “Teoriya ventilnykh skhem (sovremennoe sostoyanie)”, Diskretnaya matematika i ee prilozheniya. Sbornik lektsii molodezhnykh nauchnykh shkol po diskretnoi matematike i ee prilozheniyam, Vypusk VII, Izd-vo IPM RAN, Moskva, 2013, 23–40

   2012
17. V. V. Kochergin, “On realization of underdetermined two-column matrices by gate circuits with multiple paths”, Vestnik of Lobachevsky University of Nizhni Novgorod, 2012, no. 5, part 2, 111–116

   2009
18. V. V. Kochergin, “Ob odnom sootnoshenii dvukh mer slozhnosti vychisleniya sistem odnochlenov”, Vestnik Moskovskogo universiteta. Ser. 1. Matematika. Mekhanika, 2009, no. 4, 8–13  mathnet (cited: 4)  mathscinet  zmath  elib

   2008
19. V. V. Kochergin, “On the complexity of joint computation of three elements of free Abelian group with two generators”, Diskretn. Anal. Issled. Oper., 15:2 (2008), 23–64  mathnet  mathscinet  zmath  elib
20. V. V. Kochergin, O slozhnosti additivnykh vychislenii, Dissertatsiya na soiskanie uchenoi stepeni doktora fiziko-matematicheskikh nauk, 2008  zmath

   2007
21. V. V. Kochergin, “On the maximal complexity of calculations of systems of elements of a free Abelian group”, Moscow Univ. Math. Bull., 62:3 (2007), 95–100  mathnet  crossref  mathscinet  zmath  elib  elib
22. V. V. Kochergin, “O slozhnosti vychisleniya sistem odnochlenov i sistem tselochislennykh lineinykh form”, Diskretnaya matematika i ee prilozheniya, Sbornik lektsii molodezhnykh nauchnykh shkol po diskretnoi matematike i ee prilozheniyam, Vyp. III, Izd-vo In-ta prikladnoi matematiki RAN, Moskva, 2007, 3–63
23. V. V. Kochergin, “Asymptotics of the complexity of systems of integer linear forms for additive computations”, J. Appl. Industr. Math., 1:3 (2007), 328–342  mathnet  crossref  mathscinet  zmath  elib  elib  scopus (cited: 1)  scopus (cited: 1)

   2006
24. V. V. Kochergin, “On the complexity of computation of three monomials in three variables”, FizMatLit, Moscow, 79–155, Matematicheskie Voprosy Kibernetiki, Issue 15, FizMatLit, Moscow, 2006, 79–155

   2005
25. V. V. Kochergin, “On the complexity of the computation of a pair of monomials in two variables”, Discrete Math. Appl., 15:6 (2005), 547–572  mathnet  crossref  crossref  mathscinet  zmath  elib  elib

   1999
26. V. V. Kochergin, “On the multiplicative complexity of binary words with a given number of units”, Matematicheskie Voprosy Kibernetiki, Issue 8, FizMatLit, Moscow, 1999, 63–76

   2004
27. M. I. Grinchuk, V. V. Kochergin, “On the search of optimal order of variables in the synthesis of switching circuits by cascade technique”, Discrete Applied Mathematics, 135:1–3, 15 January (2004), 113–123  mathnet  crossref  mathscinet  mathscinet  zmath  scopus

   1998
28. V. V. Kochergin, “On the complexity of the computation of systems of monomials with restrictions on the powers of the variables”, Discrete Math. Appl., 8:4 (1998), 375–382  mathnet  crossref  mathscinet  zmath

   1996
29. V. V. Kochergin, “On the complexity of computations in finite nilpotent groups”, Diskretn. Anal. Issled. Oper., 3:1 (1996), 43–52  mathnet  mathscinet  zmath
30. V. V. Kochergin, “On asymptotically exact solution of Bellman–Knuth problems”, Fundamental Problems in Mathematics and Mechanics, The Programm “Universities of Russia”, “Universities of Russia” Publishing House, Moscow, 1996, 45

   1994
31. V. V. Kochergin, “On the computation of sets of powers”, Discrete Math. Appl., 4:2 (1994), 119–128  mathnet  mathscinet  zmath

   1996
32. V. V. Kochergin, “On the complexity of computations of monomials and tuples of powers”, Siberian Adv. Math., 6:1 (1996), 71–86  mathscinet

   1994
33. V. V. Kochergin, “A “factorization” algorithm for elements of the symmetric group”, Moscow Univ. Math. Bull., 49:1 (1994), 33–35  mathnet  mathscinet  zmath

   1993
34. V. V. Kochergin, “On the complexity of computation in finite Abelian, nilpotent and soluble groups”, Discrete Math. Appl., 3:3 (1993), 297–319  mathnet  mathscinet  zmath
35. V. V. Kochergin, “On additive computations of systems of integral linear forms”, Moscow Univ. Math. Bull., 48:6 (1993), 62–64  mathnet  mathscinet  zmath

   1992
36. V. V. Kochergin, “On the complexity of computations in finite Abelian groups”, Matematicheskie Voprosy Kibernetiki, Issue 4, Nauka, Moscow, 1992, 178–217

   1994
37. S. B. Gashkov, V. V. Kochergin, “On addition chains of vectors, gate circuits, and the complexity of computations of powers”, Siberian Adv. Math., 4:4 (1994), 1–16  mathscinet  zmath

   1991
38. V. V. Kochergin, “On the complexity of computations in finite abelian groups”, Soviet Math. Dokl., 43:2 (1991), 374–376  mathnet  mathscinet  zmath

Presentations in Math-Net.Ru
1. О сложности аддитивных вычислений
V. V. Kochergin
Seminar by Department of Discrete Mathematic, Steklov Mathematical Institute of RAS
September 23, 2008 16:00
2. Nonmonotone complexity of logic circuits and similar problems
V. V. Kochergin, A. V. Mikhailovich
International workshop "Syntax and semantics of logical systems"

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020