Geodesic
A circuit of depth two with limited input branching for voting function
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2018), pp. 58-60 
Yu. A. Kombarov. A circuit of depth two with limited input branching for voting function. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2018), pp. 58-60. http://geodesic.mathdoc.fr/item/VMUMM_2018_5_a6/
@article{VMUMM_2018_5_a6,
     author = {Yu. A. Kombarov},
     title = {A circuit of depth two with limited input branching for voting function},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {58--60},
     year = {2018},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2018_5_a6/}
}
TY  - JOUR
AU  - Yu. A. Kombarov
TI  - A circuit of depth two with limited input branching for voting function
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2018
SP  - 58
EP  - 60
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2018_5_a6/
LA  - ru
ID  - VMUMM_2018_5_a6
ER  - 
%0 Journal Article
%A Yu. A. Kombarov
%T A circuit of depth two with limited input branching for voting function
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2018
%P 58-60
%N 5
%U http://geodesic.mathdoc.fr/item/VMUMM_2018_5_a6/
%G ru
%F VMUMM_2018_5_a6

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

We show that majority Boolean function of $n$ variables can be computed by a depth-2 circuit consisting of majority gates with fan-in $n-2$ (for every odd $n$ greater than 5).

[1] Kulikov A.S., Podolskii V.V., “Computing majority by constant depth majority circuits with low fan-in gates”, 34th Symp. on Theoretical Aspects of Computer Science (STACS 2017), 2017, 49:1–49:14 | MR

[2] Engels C., Grag M., Makino K., Rao A., “On expressing majority as majority of majorities”, Electronic Colloquium on Computational Complexity, TR17-174

[3] Ugolnikov A.B., Klassy Posta, Izd-vo TsPI pri mekh.-mat. f-te MGU, M., 2008