Geodesic
Complexity of realization of a linear Boolean function in Sheffer's basis
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2013), pp. 49-53

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

The paper is focused on realization of linear Boolean functions by circuits of functional elements in the basis $\left\{\overline{x \ y}\right\}$. The exact value of complexity of negation of linear function is obtained in this paper. Another result is the description of all minimal circuts realizing a linear function. 
@article{VMUMM_2013_2_a10,
     author = {Yu. A. Kombarov},
     title = {Complexity of realization of a linear {Boolean} function in {Sheffer's} basis},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {49--53},
     publisher = {mathdoc},
     number = {2},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2013_2_a10/}
}
TY  - JOUR
AU  - Yu. A. Kombarov
TI  - Complexity of realization of a linear Boolean function in Sheffer's basis
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2013
SP  - 49
EP  - 53
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2013_2_a10/
LA  - ru
ID  - VMUMM_2013_2_a10
ER  - 
%0 Journal Article
%A Yu. A. Kombarov
%T Complexity of realization of a linear Boolean function in Sheffer's basis
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2013
%P 49-53
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_2013_2_a10/
%G ru
%F VMUMM_2013_2_a10
Yu. A. Kombarov. Complexity of realization of a linear Boolean function in Sheffer's basis. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2013), pp. 49-53. http://geodesic.mathdoc.fr/item/VMUMM_2013_2_a10/