Igor S. Sergeev

14 papers Journal 14
YearRankTypeTitle / Venue / Authors
2026 J jnl
Complexity of basic boolean operators for digital circuit design.
CoRR
Igor S. Sergeev
2025 J jnl
A note on the depth of optimal fanout-bounded prefix circuits.
CoRR
Igor S. Sergeev
2022 J jnl
Notes on the complexity of coverings for Kronecker powers of symmetric matrices.
CoRR
Igor S. Sergeev
2019 J jnl
On the monotone complexity of the shift operator.
CoRR
Igor S. Sergeev
2018 J jnl
Some comments on the structure of the best known networks sorting 16 elements.
CoRR
Igor S. Sergeev
2017 J jnl
Thin circulant matrices and lower bounds on the complexity of some Boolean operators.
CoRR
M. I. Grinchuk, Igor S. Sergeev
2016 J jnl
On the circuit complexity of the standard and the Karatsuba methods of multiplying integers.
CoRR
Igor S. Sergeev
2016 J jnl
On the complexity of computing prime tables on a Turing machine.
CoRR
Igor S. Sergeev
2014 J jnl
Fast monotone summation over disjoint sets.
Inf. Process. Lett.
Petteri Kaski, Mikko Koivisto, Janne H. Korhonen, Igor S. Sergeev
2014 J jnl
On relative OR-complexity of Boolean matrices and their complements.
CoRR
Igor S. Sergeev
2013 J jnl
A relation between additive and multiplicative complexity of Boolean functions
CoRR
Igor S. Sergeev
2013 J jnl
Implementation of linear maps with circulant matrices via modulo 2 rectifier circuits of bounded depth
CoRR
Igor S. Sergeev
2012 J jnl
A note on the fast power series' exponential
CoRR
Igor S. Sergeev
2012 J jnl
Upper bounds for the formula size of the majority function
CoRR
Igor S. Sergeev