×

Kochergin, Vadim Vasil’evich

Author ID: kochergin.vadim-vasilevich Recent zbMATH articles by "Kochergin, Vadim Vasil’evich"
Published as: Kochergin, V. V.; Kochergin, Vadim Vasil’evich; Kochergin, Vadim V.
Documents Indexed: 34 Publications since 1991, including 1 Additional arXiv Preprint
Co-Authors: 4 Co-Authors with 12 Joint Publications
50 Co-Co-Authors

Citations contained in zbMATH Open

26 Publications have been cited 81 times in 24 Documents Cited by Year
On addition chains of vectors, gate circuits and the complexity of computations of powers. Zbl 0849.68055
Gashkov, S. B.; Kochergin, V. V.
9
1992
On the complexity of circuits in bases containing monotone elements with zero weights. Zbl 1527.94098
Kochergin, V. V.; Mikhaĭlovich, A. V.
9
2015
On computational complexity in finite Abelian groups. Zbl 0828.20040
Kochergin, V. V.
6
1992
On the complexity of computations in finite Abelian groups. Zbl 0756.20009
Kochergin, V. V.
5
1991
On the complexity of computation of a pair of monomials in two variables. Zbl 1228.11181
Kochergin, V. V.
4
2005
The minimum number of negations in circuits for systems of multi-valued functions. Zbl 1441.94117
Kochergin, Vadim V.; Mikhaĭlovich, Anna V.
4
2017
Relation between two measures of the computation complexity for systems of monomials. Zbl 1304.68075
Kochergin, V. V.
4
2009
Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems. Zbl 1324.68052
Kochergin, V. V.
4
2014
On the computation of powers sets. Zbl 0925.68333
Kochergin, V. V.
3
1994
On the complexity of computations on monomials and tuples of powers. Zbl 0848.68042
Kochergin, V. V.
3
1994
On Bellman’s and Knuth’s problems and their generalizations. Zbl 1484.68073
Kochergin, V. V.
3
2018
Asymptotic complexity of additive computational systems of integer linear forms. Zbl 1249.68088
Kochergin, V. V.
3
2006
On the complexity of the simultaneous calculation of three elements of a free abelian group with two generators. Zbl 1249.94069
Kochergin, V. V.
3
2008
Asymptotics of growth for non-monotone complexity of multi-valued logic function systems. Zbl 1386.94119
Kochergin, Vadim Vasil’evich; Mikhailovich, Anna Vital’evna
3
2017
On the complexity of calculating systems of monomials with restrictions on the powers of variables. Zbl 0966.68078
Kochergin, V. V.
2
1998
On the multiplicative complexity of binary words with a given number of units. Zbl 1161.68707
Kochergin, V. V.
2
1999
Maximal computational complexity of systems of elements of free Abelian group. Zbl 1164.68009
Kochergin, V. V.
2
2007
On the complexity of multivalued logic functions over some infinite basis. Zbl 1413.94079
Kochergin, V. V.; Mikhaĭlovich, A. V.
2
2018
On some measures of complexity of finite abelian groups. Zbl 1405.20049
Kochergin, Vadim V.
2
2017
Circuit complexity of \(k\)-valued logic functions in one infinite basis. Zbl 1418.93106
Kochergin, V. V.; Mikhailovich, A. V.
2
2019
On addition computations for systems of integral linear forms. Zbl 0850.68192
Kochergin, V. V.
1
1993
On the complexity of computation in finite Abelian, nilpotent and soluble groups. Zbl 0840.20013
Kochergin, V. V.
1
1993
On the complexity of computations in finite nilpotent groups. Zbl 0866.68049
Kochergin, V. V.
1
1996
Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits. Zbl 1342.68261
Kochergin, V. V.; Kochergin, D. V.
1
2016
Comparing the computational complexity of monomials and elements of finite abelian groups. Zbl 07596803
Kochergin, V. V.
1
2022
Exact value of the nonmonotone complexity of Boolean functions. Zbl 1411.94115
Kochergin, V. V.; Mikhaĭlovich, A. V.
1
2019
Comparing the computational complexity of monomials and elements of finite abelian groups. Zbl 07596803
Kochergin, V. V.
1
2022
Circuit complexity of \(k\)-valued logic functions in one infinite basis. Zbl 1418.93106
Kochergin, V. V.; Mikhailovich, A. V.
2
2019
Exact value of the nonmonotone complexity of Boolean functions. Zbl 1411.94115
Kochergin, V. V.; Mikhaĭlovich, A. V.
1
2019
On Bellman’s and Knuth’s problems and their generalizations. Zbl 1484.68073
Kochergin, V. V.
3
2018
On the complexity of multivalued logic functions over some infinite basis. Zbl 1413.94079
Kochergin, V. V.; Mikhaĭlovich, A. V.
2
2018
The minimum number of negations in circuits for systems of multi-valued functions. Zbl 1441.94117
Kochergin, Vadim V.; Mikhaĭlovich, Anna V.
4
2017
Asymptotics of growth for non-monotone complexity of multi-valued logic function systems. Zbl 1386.94119
Kochergin, Vadim Vasil’evich; Mikhailovich, Anna Vital’evna
3
2017
On some measures of complexity of finite abelian groups. Zbl 1405.20049
Kochergin, Vadim V.
2
2017
Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits. Zbl 1342.68261
Kochergin, V. V.; Kochergin, D. V.
1
2016
On the complexity of circuits in bases containing monotone elements with zero weights. Zbl 1527.94098
Kochergin, V. V.; Mikhaĭlovich, A. V.
9
2015
Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems. Zbl 1324.68052
Kochergin, V. V.
4
2014
Relation between two measures of the computation complexity for systems of monomials. Zbl 1304.68075
Kochergin, V. V.
4
2009
On the complexity of the simultaneous calculation of three elements of a free abelian group with two generators. Zbl 1249.94069
Kochergin, V. V.
3
2008
Maximal computational complexity of systems of elements of free Abelian group. Zbl 1164.68009
Kochergin, V. V.
2
2007
Asymptotic complexity of additive computational systems of integer linear forms. Zbl 1249.68088
Kochergin, V. V.
3
2006
On the complexity of computation of a pair of monomials in two variables. Zbl 1228.11181
Kochergin, V. V.
4
2005
On the multiplicative complexity of binary words with a given number of units. Zbl 1161.68707
Kochergin, V. V.
2
1999
On the complexity of calculating systems of monomials with restrictions on the powers of variables. Zbl 0966.68078
Kochergin, V. V.
2
1998
On the complexity of computations in finite nilpotent groups. Zbl 0866.68049
Kochergin, V. V.
1
1996
On the computation of powers sets. Zbl 0925.68333
Kochergin, V. V.
3
1994
On the complexity of computations on monomials and tuples of powers. Zbl 0848.68042
Kochergin, V. V.
3
1994
On addition computations for systems of integral linear forms. Zbl 0850.68192
Kochergin, V. V.
1
1993
On the complexity of computation in finite Abelian, nilpotent and soluble groups. Zbl 0840.20013
Kochergin, V. V.
1
1993
On addition chains of vectors, gate circuits and the complexity of computations of powers. Zbl 0849.68055
Gashkov, S. B.; Kochergin, V. V.
9
1992
On computational complexity in finite Abelian groups. Zbl 0828.20040
Kochergin, V. V.
6
1992
On the complexity of computations in finite Abelian groups. Zbl 0756.20009
Kochergin, V. V.
5
1991