Geodesic
On minimal circuts in Sheffer basis for linear Boolean functions
Diskretnyj analiz i issledovanie operacij, Tome 20 (2013) no. 4, pp. 65-87

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

Realizations of pairity function and its negation by Boolean circuits in Sheffer basis are considered. The exact value of complexity of pairity function's negation is established. Another result is structure description of minimal circuits for the parity function. Ill. 13, bibliogr. 8.
Keywords: Boolean circuit, pairity function, Sheffer stroke. 
@article{DA_2013_20_4_a5,
     author = {Yu. A. Kombarov},
     title = {On minimal circuts in {Sheffer} basis for linear {Boolean} functions},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {65--87},
     publisher = {mathdoc},
     volume = {20},
     number = {4},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2013_20_4_a5/}
}
TY  - JOUR
AU  - Yu. A. Kombarov
TI  - On minimal circuts in Sheffer basis for linear Boolean functions
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2013
SP  - 65
EP  - 87
VL  - 20
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2013_20_4_a5/
LA  - ru
ID  - DA_2013_20_4_a5
ER  - 
%0 Journal Article
%A Yu. A. Kombarov
%T On minimal circuts in Sheffer basis for linear Boolean functions
%J Diskretnyj analiz i issledovanie operacij
%D 2013
%P 65-87
%V 20
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2013_20_4_a5/
%G ru
%F DA_2013_20_4_a5
Yu. A. Kombarov. On minimal circuts in Sheffer basis for linear Boolean functions. Diskretnyj analiz i issledovanie operacij, Tome 20 (2013) no. 4, pp. 65-87. http://geodesic.mathdoc.fr/item/DA_2013_20_4_a5/