Geodesic
Asymptotically best method for synthesis of Boolean recursive circuits
Diskretnaya Matematika, Tome 31 (2019) no. 1, pp. 99-110

Voir la notice de l'article provenant de la source Math-Net.Ru

Models of multi-output and scalar recursive Boolean circuits of bounded depth in an arbitrary basis are considered. Methods for lower and upper estimates for the Shannon function for the complexity of circuits of these classes are provided. Based on these methods, an asymptotic formula for the Shannon function is put forward. Moreover, in the above classes of recursive circuits, upper estimates for the complexity of implementation of some functions and systems of functions used in applications are obtained.
Keywords: recursive circuits of gates, complexity of Boolean functions, Shannon function, asymptotic estimates. 
@article{DM_2019_31_1_a5,
     author = {V. V. Zhukov and S. A. Lozhkin},
     title = {Asymptotically best method for synthesis of {Boolean} recursive circuits},
     journal = {Diskretnaya Matematika},
     pages = {99--110},
     publisher = {mathdoc},
     volume = {31},
     number = {1},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2019_31_1_a5/}
}
TY  - JOUR
AU  - V. V. Zhukov
AU  - S. A. Lozhkin
TI  - Asymptotically best method for synthesis of Boolean recursive circuits
JO  - Diskretnaya Matematika
PY  - 2019
SP  - 99
EP  - 110
VL  - 31
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2019_31_1_a5/
LA  - ru
ID  - DM_2019_31_1_a5
ER  - 
%0 Journal Article
%A V. V. Zhukov
%A S. A. Lozhkin
%T Asymptotically best method for synthesis of Boolean recursive circuits
%J Diskretnaya Matematika
%D 2019
%P 99-110
%V 31
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2019_31_1_a5/
%G ru
%F DM_2019_31_1_a5
V. V. Zhukov; S. A. Lozhkin. Asymptotically best method for synthesis of Boolean recursive circuits. Diskretnaya Matematika, Tome 31 (2019) no. 1, pp. 99-110. http://geodesic.mathdoc.fr/item/DM_2019_31_1_a5/