Geodesic
Periodic Boolean functions and a lower bound for the complexity of operators
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2003), pp. 25-28

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

@article{VMUMM_2003_2_a5,
     author = {S. N. Preobrazhenskii},
     title = {Periodic {Boolean} functions and a lower bound for the complexity of operators},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {25--28},
     publisher = {mathdoc},
     number = {2},
     year = {2003},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2003_2_a5/}
}
TY  - JOUR
AU  - S. N. Preobrazhenskii
TI  - Periodic Boolean functions and a lower bound for the complexity of operators
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2003
SP  - 25
EP  - 28
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2003_2_a5/
LA  - ru
ID  - VMUMM_2003_2_a5
ER  - 
%0 Journal Article
%A S. N. Preobrazhenskii
%T Periodic Boolean functions and a lower bound for the complexity of operators
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2003
%P 25-28
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_2003_2_a5/
%G ru
%F VMUMM_2003_2_a5
S. N. Preobrazhenskii. Periodic Boolean functions and a lower bound for the complexity of operators. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2003), pp. 25-28. http://geodesic.mathdoc.fr/item/VMUMM_2003_2_a5/