Igor S. Sergeev

According to our database, Igor S. Sergeev authored at least 14 papers between 2012 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Complexity of basic boolean operators for digital circuit design.

Igor S. Sergeev

CoRR, March, 2026

2025

A note on the depth of optimal fanout-bounded prefix circuits.

Igor S. Sergeev

CoRR, December, 2025

2022

Notes on the complexity of coverings for Kronecker powers of symmetric matrices.

Igor S. Sergeev

CoRR, 2022

2019

On the monotone complexity of the shift operator.

Igor S. Sergeev

CoRR, 2019

2018

Some comments on the structure of the best known networks sorting 16 elements.

Igor S. Sergeev

CoRR, 2018

2017

Thin circulant matrices and lower bounds on the complexity of some Boolean operators.

M. I. Grinchuk, Igor S. Sergeev

CoRR, 2017

2016

On the complexity of computing prime tables on a Turing machine.

Igor S. Sergeev

CoRR, 2016

On the circuit complexity of the standard and the Karatsuba methods of multiplying integers.

Igor S. Sergeev

CoRR, 2016

2014

Fast monotone summation over disjoint sets.

Petteri Kaski, Mikko Koivisto, Janne H. Korhonen, Igor S. Sergeev

Inf. Process. Lett., 2014

On relative OR-complexity of Boolean matrices and their complements.

Igor S. Sergeev

CoRR, 2014

2013

Implementation of linear maps with circulant matrices via modulo 2 rectifier circuits of bounded depth

Igor S. Sergeev

CoRR, 2013

A relation between additive and multiplicative complexity of Boolean functions

Igor S. Sergeev

CoRR, 2013

2012

Upper bounds for the formula size of the majority function

Igor S. Sergeev

CoRR, 2012

A note on the fast power series' exponential

Igor S. Sergeev

CoRR, 2012