Persons: Kochergin, Vadim Vasil'evich

Persons

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Kochergin, Vadim Vasil'evich

Statistics
in MathSciNet:	27 (27)
in zbMATH:	21 (21)
in Web of Science:	9 (9)
in Scopus:	14 (14)

Professor

Doctor of physico-mathematical sciences (2008)

Speciality:

01.01.09 (Discrete mathematics and mathematical cybernetics)

Birth date:

16.05.1966

E-mail:

Website:

https://math.msu.ru/node/811

https://www.mathnet.ru/eng/person27798

List of publications on Google Scholar

https://mathscinet.ams.org/mathscinet/MRAuthorID/312064

ISTINA

https://istina.msu.ru/workers/2703593

List of publications:

scientific publications

by years

by types

by times cited

common list

		Citations (Crossref Cited-By Service + Math-Net.Ru)

1.	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
2.	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
3.	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
4.	V. V. Kochergin, “On Bellman's and Knuth's problems and their generalizations”, J. Math. Sci., 233:1 (2018), 103–124
5.	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
6.	V. V. Kochergin, “On the complexity of computations in finite abelian groups”, Soviet Math. Dokl., 43:2 (1991), 374–376
7.	V. V. Kochergin, A. V. Mikhailovich, “Exact Value of the Nonmonotone Complexity of Boolean Functions”, Math. Notes, 105:1 (2019), 28–35
8.	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
9.	Vadim V. Kochergin, “On some measures of complexity of finite Abelian groups”, Discrete Mathematics and Applications, 27:2 (2017), 81–95
10.	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
11.	V. V. Kochergin, “Ob odnom sootnoshenii dvukh mer slozhnosti vychisleniya sistem odnochlenov”, Vestnik Moskovskogo universiteta. Ser. 1. Matematika. Mekhanika, 2009, no. 4, 8–13	4 ^[x]
12.	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
13.	V. V. Kochergin, “Asymptotics of growth for non-monotone complexity of multi-valued logic function systems”, Sib. elektron. matem. izv., 14 (2017), 1100–1107	3 ^[x]
14.	V. V. Kochergin, D. V. Kochergin, “Improvement of the lower bound for the complexity of exponentiation”, Prikl. Diskr. Mat., 2017, no. 38, 119–132
15.	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
16.	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
17.	V. V. Kochergin, “On the computation of sets of powers”, Discrete Math. Appl., 4:2 (1994), 119–128
18.	V. V. Kochergin, “On additive computations of systems of integral linear forms”, Moscow Univ. Math. Bull., 48:6 (1993), 62–64
19.	V. V. Kochergin, A. V. Mikhailovich, “Improvement of Nonmonotone Complexity Estimates of $k$-Valued Logic Functions”, Math. Notes, 113:6 (2023), 794–803
20.	V. V. Kochergin, “On the computation complexity of the systems of finite Abelian group elements”, Moscow University Mathematics Bulletin, 78:4 (2023), 179–187
21.	V. V. Kochergin, A. V. Mikhailovich, “Bounds of non-monotone complexity for the multi-valued logic functions”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 162, no. 3, Kazan University, Kazan, 2020, 311–321
22.	V. V. Kochergin, “On the complexity of computations of monomials and tuples of powers”, Trudy Inst. Mat. SO RAN, 27 (1994), 94–107
23.	V. V. Kochergin, “Comparing the computational complexity of monomials and elements of finite Abelian groups”, Moscow University Mathematics Bulletin, 77:3 (2022), 113–119
24.	V. V. Kochergin, “On the papers of O. M. Kasim-Zade in field of complexity theory and theory of multivalued logics”, Chebyshevskii Sb., 23:2 (2022), 121–150
25.	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
26.	V. V. Kochergin, “On the complexity of computations in finite nilpotent groups”, Diskretn. Anal. Issled. Oper., 3:1 (1996), 43–52
27.	V. V. Kochergin, “On the complexity of computation in finite Abelian, nilpotent and soluble groups”, Discrete Math. Appl., 3:3 (1993), 297–319
28.	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
29.	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
30.	V. V. Kochergin, A. V. Mikhailovich, Some extensions of the inversion complexity of Boolean functions, 2015 (Published online) , 5 pp., arXiv: arXiv:1506.04485
31.	V. V. Kochergin, A. V. Mikhailovich, Inversion complexity of functions of multi-valued logic, 2015 (Published online) , 11 pp., arXiv: arXiv:1510.05942
32.	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
33.	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
34.	V. V. Kochergin, O slozhnosti additivnykh vychislenii, Dissertatsiya na soiskanie uchenoi stepeni doktora fiziko-matematicheskikh nauk, 2008
35.	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
36.	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
37.	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
38.	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
39.	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
40.	V. V. Kochergin, “On the complexity of computations of monomials and tuples of powers”, Siberian Adv. Math., 6:1 (1996), 71–86
41.	V. V. Kochergin, “A “factorization” algorithm for elements of the symmetric group”, Moscow Univ. Math. Bull., 49:1 (1994), 33–35
42.	V. V. Kochergin, “On the complexity of computations in finite Abelian groups”, Matematicheskie Voprosy Kibernetiki, Issue 4, Nauka, Moscow, 1992, 178–217
43.	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
44.	V. V. Kochergin, A. V. Mikhailovich, “The exact circuit complexity of Boolean functions in an infinite basis”, Math. Notes, 117:4 (2025), 579–594
45.	V. V. Kochergin, N. P. Red'kin, S. B. Gashkov, A. V. Chashkin, R. M. Kolpakov, M. D. Kovalev, Yu. V. Tarannikov, O. S. Dudakova, Yu. A. Kombarov, M. V. Starostin, S. A. Korneev, “The Chair of Discrete Mathematics”, Moscow University Mathematics Bulletin, 79:6 (2024), 322–333
46.	S. B. Gashkov, O. S. Dudakova, R. M. Kolpakov, V. V. Kochergin, N. A. Leontieva, N. P. Red'kin, A. V. Chashkin, V. N. Chubarikov, A. D. Yashunskii, “Aleksandr Borisovich Ugol'nikov (04.12.1951–19.07.2013)”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2021, no. 6, 58–62
47.	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
48.	V. B. Alekseev, V. A. Vatutin, V. A. Emelichev, Yu. L. Ershov, G. I. Ivchenko, V. V. Kochergin, Yu. V. Matiyasevich, Yu. I. Medvedev, Yu. L. Pavlov, B. A. Pogorelov, È. A. Primenko, L. Ya. Savel'ev, V. N. Sachkov, S. A. Stepanov, Yu. S. Kharin, V. N. Chubarikov, D. A. Shabanov, “Zubkov Andrey Mikhailovich (30.12.1946-06.08.2025)”, Diskr. Mat., 37:3 (2025)
49.	V. V. Aleksandrov, S. B. Gashkov, D. V. Georgievskii, O. S. Dudakova, V. P. Karlikov, B. S. Kashin, G. M. Kobel'kov, M. D. Kovalev, V. V. Kozlov, R. M. Kolpakov, V. V. Kochergin, T. P. Lukashenko, A. S. Mishchenko, Yu. V. Nesterenko, R. I. Nigmatulin, N. P. Red'kin, V. A. Sadovnichii, I. N. Sergeev, A. T. Fomenko, A. V. Chashkin, V. N. Chubarikov, A. I. Shafarevich, A. N. Shiryaev, V. Ya. Shkadov, A. A. Shkalikov, “90 years since the birthday of Academician Oleg Borisovich Lupanov (02.06.1932 – 03.05.2006)”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2022, no. 3, 3–5
50.	S. B. Gashkov, O. S. Dudakova, M. D. Kovalev, R. M. Kolpakov, V. V. Kochergin, N. P. Red'kin, A. T. Fomenko, A. V. Chashkin, V. N. Chubarikov, A. I. Shafarevich, A. D. Yashunskii, “Oktay Muradoviсh Kasim-Zade (29.04.1953–22.12.2020)”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2021, no. 4, 60–63

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