Vadim V. Kochergin

Available identifiers

zbMath Open kochergin.vadim-vasilevichMaRDI QIDQ1675531

List of research outcomes

Publication	Date of Publication	Type
On the computation complexity of the systems of finite abelian group elements	2024-02-16	Paper
On the papers of O. M. Kasim-Zade in field of complexity theory and theory of multivalued logics	2023-08-31	Paper
Improvement of nonmonotone complexity estimates of \(k\)-valued logic functions	2023-07-11	Paper
Comparing the computational complexity of monomials and elements of finite abelian groups	2022-10-06	Paper
IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION	2021-02-16	Paper
ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS	2021-02-15	Paper
A simple proof for the upper bound of the computational complexity of three monomials in three variables	2019-08-21	Paper
Circuit complexity of \(k\)-valued logic functions in one infinite basis	2019-08-20	Paper
Exact value of the nonmonotone complexity of Boolean functions	2019-07-19	Paper
On the Complexity of Multivalued Logic Functions over Some Infinite Basis	2018-10-30	Paper
On Bellman's and Knuth's problems and their generalizations	2018-10-11	Paper
The minimum number of negations in circuits for systems of multi-valued functions	2018-04-23	Paper
Asymptotics of growth for non-monotone complexity of multi-valued logic function systems	2017-12-13	Paper
On some measures of complexity of finite abelian groups	2017-11-02	Paper
Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits	2016-07-15	Paper
Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems	2015-07-27	Paper
Some Extensions of the Inversion Complexity of Boolean Functions	2015-06-15	Paper
Relation between two measures of the computation complexity for systems of monomials	2015-02-02	Paper
https://portal.mardi4nfdi.de/entity/Q3115593	2012-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q3115682	2012-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q3541512	2008-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q5445407	2008-03-05	Paper
On the complexity of computation of a pair of monomials in two variables	2006-10-10	Paper
On the complexity of calculating systems of monomials with restrictions on the powers of variables	2001-01-04	Paper
On the search of optimal order of variables in the synthesis of switching circuits by cascade technique	1998-11-22	Paper
A ``factorization algorithm for elements of a symmetric group	1998-02-19	Paper
https://portal.mardi4nfdi.de/entity/Q4888936	1996-08-25	Paper
On the complexity of computations on monomials and tuples of powers	1996-08-19	Paper
On addition computations for systems of integral linear forms	1996-03-27	Paper
https://portal.mardi4nfdi.de/entity/Q4301392	1996-02-21	Paper
On the computation of powers sets	1995-05-17	Paper
On the complexity of computation in finite Abelian, nilpotent and soluble groups	1994-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q4301460	1994-08-29	Paper
https://portal.mardi4nfdi.de/entity/Q4005480	1992-09-27	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Vadim V. Kochergin