Geodesic
Lower complexity estimates for some sequences of functions of multivalued logic
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 6 (2013), pp. 25-30 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The problem of realization of functions of a multi-valued logic by formulas is considered. Some sequences of functions whose realization complexity exceeds exponential one are presented. 
@article{VMUMM_2013_6_a4,
     author = {A. A. Andreev},
     title = {Lower complexity estimates for some sequences of functions of multivalued logic},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {25--30},
     year = {2013},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2013_6_a4/}
}
TY  - JOUR
AU  - A. A. Andreev
TI  - Lower complexity estimates for some sequences of functions of multivalued logic
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2013
SP  - 25
EP  - 30
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2013_6_a4/
LA  - ru
ID  - VMUMM_2013_6_a4
ER  - 
%0 Journal Article
%A A. A. Andreev
%T Lower complexity estimates for some sequences of functions of multivalued logic
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2013
%P 25-30
%N 6
%U http://geodesic.mathdoc.fr/item/VMUMM_2013_6_a4/
%G ru
%F VMUMM_2013_6_a4
A. A. Andreev. Lower complexity estimates for some sequences of functions of multivalued logic. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 6 (2013), pp. 25-30. http://geodesic.mathdoc.fr/item/VMUMM_2013_6_a4/

[1] Yablonskii S.V., Vvedenie v diskretnuyu matematiku, Vysshaya shkola, M., 2003 | MR

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

[3] Lupanov O.B., Asimptoticheskie otsenki slozhnosti upravlyayuschikh sistem, Izd-vo MGU, M., 1984

[4] Ugolnikov A.B., “O glubine i slozhnosti formul, realizuyuschikh funktsii iz zamknutykh klassov”, Dokl. AN SSSR, 298:6 (1988), 1341–1344 | MR

[5] Ugolnikov A.B., “O glubine formul v nepolnykh bazisakh”, Matematicheskie voprosy kibernetiki, 1, Nauka, M., 1988, 242–245 | MR

[6] Ugolnikov A.B., “O slozhnosti realizatsii formulami odnoi posledovatelnosti funktsii 4-znachnoi logiki”, Vestn. Mosk. un-ta. Matem. Mekhan., 2004, no. 3, 52–55 | MR

[7] Ugolnikov A.B., “O slozhnosti realizatsii formulami odnoi posledovatelnosti funktsii mnogoznachnoi logiki”, Matematicheskie voprosy kibernetiki, 2, Nauka, M., 1989, 174–176 | MR

[8] Andreev A.A., “Ob odnoi posledovatelnosti funktsii mnogoznachnoi logiki”, Vestn. Mosk. un-ta. Matem. Mekhan., 2011, no. 6, 52–57

[9] Andreev A.A., “Ob odnoi posledovatelnosti funktsii mnogoznachnoi logiki”, Mat-ly XI Mezhdunar. seminara “Diskretnaya matematika i ee prilozheniya”, Izd-vo TsPI pri mekh.-mat. f-te MGU, M., 2012, 88–90