Geodesic
Multilevel representation and complexity of circuits of unbounded fan-in gates
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2020), pp. 42-46

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

A new simpler proof of the asymptotic $C(n)\sim\sqrt2\cdot2^{n/2}$ of the Shannon function of the circuit complexity over the basis of multi-input generalized conjunctions is obtained. 
@article{VMUMM_2020_3_a5,
     author = {I. S. Sergeev},
     title = {Multilevel representation and complexity of circuits of unbounded fan-in gates},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {42--46},
     publisher = {mathdoc},
     number = {3},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2020_3_a5/}
}
TY  - JOUR
AU  - I. S. Sergeev
TI  - Multilevel representation and complexity of circuits of unbounded fan-in gates
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2020
SP  - 42
EP  - 46
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2020_3_a5/
LA  - ru
ID  - VMUMM_2020_3_a5
ER  - 
%0 Journal Article
%A I. S. Sergeev
%T Multilevel representation and complexity of circuits of unbounded fan-in gates
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2020
%P 42-46
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_2020_3_a5/
%G ru
%F VMUMM_2020_3_a5
I. S. Sergeev. Multilevel representation and complexity of circuits of unbounded fan-in gates. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2020), pp. 42-46. http://geodesic.mathdoc.fr/item/VMUMM_2020_3_a5/