Geodesic
Refined bounds on Shannon’s function for complexity of circuits of functional elements
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2022), pp. 32-40 
S. A. Lozhkin. Refined bounds on Shannon’s function for complexity of circuits of functional elements. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2022), pp. 32-40. http://geodesic.mathdoc.fr/item/VMUMM_2022_3_a6/
@article{VMUMM_2022_3_a6,
     author = {S. A. Lozhkin},
     title = {Refined bounds on {Shannon{\textquoteright}s} function for complexity of circuits of functional elements},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {32--40},
     year = {2022},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2022_3_a6/}
}
TY  - JOUR
AU  - S. A. Lozhkin
TI  - Refined bounds on Shannon’s function for complexity of circuits of functional elements
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2022
SP  - 32
EP  - 40
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2022_3_a6/
LA  - ru
ID  - VMUMM_2022_3_a6
ER  - 
%0 Journal Article
%A S. A. Lozhkin
%T Refined bounds on Shannon’s function for complexity of circuits of functional elements
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2022
%P 32-40
%N 3
%U http://geodesic.mathdoc.fr/item/VMUMM_2022_3_a6/
%G ru
%F VMUMM_2022_3_a6

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

Earlier, the author proposed rather general approaches and methods for obtaining high accuracy and close to high accuracy asymptotic bounds on Shannon's function for complexity in various classes of circuits. Most of the results obtained with their aid were published in a number of papers, except perhaps for the close to the high accuracy asymptotic bounds on Shannon's function for the complexity of circuits without restrictions on their structure. This paper fills this gap and presents a modified and simplified version of one of the above-mentioned methods, which, nevertheless, allows one to obtain bounds with the required accuracy.

[1] Yablonskii S.V., Vvedenie v diskretnuyu matematiku, Nauka, M., 1986 | MR

[2] Lupanov O.B., Asimptoticheskie otsenki slozhnosti upravlyayuschikh skhem, Izd-vo Mosk. un-ta, M., 1984

[3] Lozhkin S.A., Lektsii po osnovam kibernetiki, Izdatelskii otdel fakulteta VMiK MGU im. M. V. Lomonosova, M., 2004

[4] Lupanov O.B., “Ob odnom metode sinteza skhem”, Izv. vuzov. Radiofizika, 1 (1958), 120–140

[5] Lupanov O.B., “O slozhnosti realizatsii funktsii algebry logiki formulami”, Problemy kibernetiki, 3, Fizmatgiz, M., 1960, 61–80

[6] Lozhkin S.A., “Otsenki vysokoi stepeni tochnosti dlya slozhnosti upravlyayuschikh sistem iz nekotorykh klassov”, Matematicheskie voprosy kibernetiki, 6, Nauka, M., 1996, 189–214 | MR

[7] Lozhkin S.A., Asimptoticheskie otsenki vysokoi stepeni tochnosti dlya slozhnosti upravlyayuschikh sistem, Dokt. dis., M., 1997

[8] Lozhkin S.A., “O sinteze formul, slozhnost i glubina kotorykh ne prevoskhodyat asimptoticheski nailuchshikh otsenok vysokoi stepeni tochnosti”, Vestn. Mosk. un-ta. Matem. Mekhan., 2007, no. 3, 19–25 | Zbl

[9] Lozhkin S.A., Shiganov A.E., “High accuracy asymptotic bounds on the BDD size and weight of the hardest functions”, Fundamenta Informaticae, 104:3 (2010), 239–253 | DOI | MR | Zbl

[10] Lozhkin S.A., Konovodov V.A., “O sinteze i slozhnosti formul s ogranichennoi glubinoi alternirovaniya”, Vestn. Mosk. un-ta. Vychisl. matem. i kibern., 2012, no. 2, 28–36 | Zbl