| Publication | Date of Publication | Type |
|---|
| Unsolvability of some problems about piecewise-polynomial functions | 2023-09-21 | Paper |
| Fast algorithms for solving equations of degree \(\le 4\) in some finite fields | 2021-11-23 | Paper |
| A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices | 2021-05-28 | Paper |
| ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO | 2021-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5150372 | 2021-02-15 | Paper |
| The complexity of solving low degree equations over ring of integers and residue rings | 2019-08-21 | Paper |
| Fast algorithm of square rooting in some finite fields of odd characteristic | 2019-02-14 | Paper |
| On the application of linear positive operators for approximation of functions | 2017-04-05 | Paper |
| On the additive complexity of GCD and LCM matrices | 2017-02-08 | Paper |
| Arithmetic complexity of the Stirling transforms | 2016-09-13 | Paper |
| The arithmetic computational complexity of linear transforms | 2015-07-30 | Paper |
| Arithmetic complexity of certain linear transformations | 2015-07-03 | Paper |
| Complexity of approximation of Lipschitz functions | 2015-02-02 | Paper |
| The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) | 2015-02-02 | Paper |
| On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings | 2014-06-06 | Paper |
| Complexity of computation in finite fields | 2013-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857861 | 2013-11-19 | Paper |
| On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2 | 2013-10-08 | Paper |
| Complexity of approximate realizations of Lipschitz functions by schemes in continuous bases | 2013-02-22 | Paper |
| Realization of Boolean functions by formulas in continuous bases containing a continuum of constants | 2013-02-22 | Paper |
| A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials | 2013-02-04 | Paper |
| Vladimir Nikolaevich Chubarikov (on his 60th birthday) | 2012-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115217 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115626 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115628 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115701 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3005904 | 2011-06-10 | Paper |
| Complexity of implementation of Boolean functions by real formulas | 2010-07-21 | Paper |
| On design of circuits of logarithmic depth for inversion in finite fields | 2009-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3597518 | 2009-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5504795 | 2009-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3541510 | 2008-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3499664 | 2008-06-02 | Paper |
| Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials | 2008-03-04 | Paper |
| An application of the method of additive chains to inversion in finite fields | 2007-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5296655 | 2007-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5472004 | 2006-06-14 | Paper |
| Computational Science - ICCS 2004 | 2005-12-23 | Paper |
| On the complexity of calculation of differentials and gradients | 2005-11-14 | Paper |
| On a quick multiplication in normal bases of finite fields | 2004-08-30 | Paper |
| On fast multiplication of polynomials, the Fourier and Hartley transforms | 2002-12-17 | Paper |
| A simplified substantiation of the probabilistic Miller-Rabin primality test | 2001-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4396564 | 1999-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230575 | 1999-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4384378 | 1998-04-20 | Paper |
| ``Curse of dimensionality for complexity of approximation for classes of functions satisfying Lipschitz condition | 1998-01-25 | Paper |
| On the complexity of the approximation of functions with given moduli of continuity of the first and second orders in some piecewise linear and polynomial bases | 1997-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4866424 | 1996-10-31 | Paper |
| On the complexity of approximate realization of some classical functions | 1996-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4301392 | 1996-02-21 | Paper |
| On the complexity of approximate computation of real numbers by schemes and formulae in different rational bases | 1994-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4029617 | 1993-03-28 | Paper |
| Hardly realizable Boolean functions and hardly computable real numbers | 1992-06-25 | Paper |
| Ein einfacher geometrischer Beweis für die Determinantenungleichung von O. Szasz. (Simple geometrical proof of the determinant inequality of O. Szasz) | 1990-01-01 | Paper |
| On parallel evaluation of certain classes of polynomials with an increasing number of variables | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3212286 | 1990-01-01 | Paper |
| Complexity of approximate realization of functions, satisfying the Lipschitz condition, by schemes in continuous bases | 1988-01-01 | Paper |
| On the complexity of the computation of certain classes of polynomials of several variables | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3802603 | 1988-01-01 | Paper |
| The complexity of monotone computations of polynomials | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3782775 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3784578 | 1987-01-01 | Paper |
| The complexity of approximate ``scheme and formula realization of continuous functions and continual analogues of ``Shannon's effect | 1986-01-01 | Paper |
| On the complexity of approximate realization for classes of functions of several variables by schemes and formulas in bases of continuous functions | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3757243 | 1986-01-01 | Paper |
| On the complexity of the approximate realization of certain classes of differentiable functions of one variable by formulas in certain continuous bases | 1984-01-01 | Paper |
| Complexity of approximate realization of some classes of differentiable functions of one variable by schemes of functional elements | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3218068 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3704345 | 1984-01-01 | Paper |
| On the complexity of approximate realization of analytic functions by networks and formulas | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3885671 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3941345 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3205168 | 1978-01-01 | Paper |
