| Publication | Date of Publication | Type |
|---|
A lower bound on the monotone switching complexity of the threshold function \(T_n^{n-1}\)
Discrete Mathematics and Applications | 2026-02-23 | Paper |
Lower bounds for additive complexity of linear operators and bilinear algorithms for matrix and polynomial multiplication over GF(2)
Mathematical Notes | 2025-12-30 | Paper |
On the additive complexity of some integer sequences
Mathematical Notes | 2024-07-09 | Paper |
On the multiplicative complexity of polynomials
Discrete Mathematics and Applications | 2024-06-03 | Paper |
| An explicit finite $B_k$-sequence | 2023-04-08 | Paper |
On a relation between the depth and complexity of monotone Boolean formulas
Diskretnyi analiz i issledovanie operatsii | 2022-07-15 | Paper |
On the complexity of monotone circuits for threshold symmetric Boolean functions
Discrete Mathematics and Applications | 2022-01-05 | Paper |
Formula complexity of a linear function in a \(k\)-ary basis
Mathematical Notes | 2021-07-08 | Paper |
Multilevel representation and complexity of circuits of unbounded fan-in gates
Moscow University Mathematics Bulletin | 2021-05-28 | Paper |
On the upper bound of the complexity of sorting
Computational Mathematics and Mathematical Physics | 2021-04-15 | Paper |
On the meaning of works by V. M. Khrapchenko
Prikladnaya Diskretnaya Matematika | 2021-02-17 | Paper |
| Multiplication | 2021-02-15 | Paper |
| Regular estimates for the complexity of polynomial multiplication and truncated Fourier transform | 2021-02-15 | Paper |
ON THE COMPLEXITY OF COMPUTING PRIME TABLES ON THE TURING MACHINE
Prikladnaya diskretnaya matematika | 2021-02-15 | Paper |
ON THE COMPLEXITY OF COMPUTING PRIME TABLES ON THE TURING MACHINE
Prikladnaya diskretnaya matematika | 2021-02-15 | Paper |
On the complexity of Fibonacci coding
Problems of Information Transmission | 2019-12-10 | Paper |
On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
Discrete Mathematics and Applications | 2019-11-05 | Paper |
Rectifier circuits of bounded depth
Journal of Applied and Industrial Mathematics | 2018-10-30 | Paper |
On the real complexity of a complex DFT
Problems of Information Transmission | 2018-05-24 | Paper |
Upper bounds for the size and the depth of formulae for MOD-functions
Discrete Mathematics and Applications | 2017-11-02 | Paper |
On the additive complexity of GCD and LCM matrices
Mathematical Notes | 2017-02-08 | Paper |
Complexity and depth of formulas for symmetric Boolean functions
Moscow University Mathematics Bulletin | 2016-11-01 | Paper |
Upper bounds on the depth of symmetric Boolean functions
Moscow University Computational Mathematics and Cybernetics | 2016-04-05 | Paper |
The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
Moscow University Mathematics Bulletin | 2015-02-02 | Paper |
Minimal parallel prefix circuits
Moscow University Mathematics Bulletin | 2015-02-02 | Paper |
Upper bounds for the formula size of symmetric Boolean functions
Russian Mathematics | 2014-10-31 | Paper |
Fast monotone summation over disjoint sets
Information Processing Letters | 2014-04-15 | Paper |
Complexity of computation in finite fields
Journal of Mathematical Sciences (New York) | 2013-11-20 | Paper |
On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
Discrete Mathematics and Applications | 2013-10-08 | Paper |
A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials
Sbornik: Mathematics | 2013-02-04 | Paper |
Thin circulant matrices and lower bounds on complexity of some Boolean operators
(available as arXiv preprint) | 2012-02-20 | Paper |
| On the complexity of linear Boolean operators with thin matrices | 2012-02-20 | Paper |
| scientific article; zbMATH DE number 6004896 (Why is no real title available?) | 2012-02-10 | Paper |
| On the complexity of the gradient of a rational function | 2012-02-10 | Paper |
| scientific article; zbMATH DE number 6004960 (Why is no real title available?) | 2012-02-10 | Paper |
Fast algorithms for elementary operations on complex power series
Discrete Mathematics and Applications | 2010-09-06 | Paper |
On design of circuits of logarithmic depth for inversion in finite fields
Discrete Mathematics and Applications | 2009-10-21 | Paper |
| scientific article; zbMATH DE number 5504474 (Why is no real title available?) | 2009-02-09 | Paper |
| On inversion in finite fields of characteristic 2 with logarithmic depth | 2008-11-25 | Paper |
On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
Discrete Mathematics and Applications | 2008-02-08 | Paper |
An application of the method of additive chains to inversion in finite fields
Discrete Mathematics and Applications | 2007-11-02 | Paper |
