Geodesic
The complexity of pseudo-linear functions
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2010), pp. 53-56

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

Upper and lower estimates for the complexity of functions of the $3$-valued logic taking values from the set $\{0,1\}$ with linear Boolean restrictions are derived. 
@article{VMUMM_2010_2_a11,
     author = {D. A. Dagaev},
     title = {The complexity of pseudo-linear functions},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {53--56},
     publisher = {mathdoc},
     number = {2},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2010_2_a11/}
}
TY  - JOUR
AU  - D. A. Dagaev
TI  - The complexity of pseudo-linear functions
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2010
SP  - 53
EP  - 56
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2010_2_a11/
LA  - ru
ID  - VMUMM_2010_2_a11
ER  - 
%0 Journal Article
%A D. A. Dagaev
%T The complexity of pseudo-linear functions
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2010
%P 53-56
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_2010_2_a11/
%G ru
%F VMUMM_2010_2_a11
D. A. Dagaev. The complexity of pseudo-linear functions. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2010), pp. 53-56. http://geodesic.mathdoc.fr/item/VMUMM_2010_2_a11/