Geodesic
On the comparison of the complexity of two methods for realizing some linear Boolean transformations
Diskretnaya Matematika, Tome 8 (1996) no. 2, pp. 151-159
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

We study the complexity of realization of systems of Boolean functions by circuits over the basis of elements of addition modulo $2$. The systems of functions determined by matrices without rectangles are considered. 
@article{DM_1996_8_2_a10,
     author = {K. A. Zykov},
     title = {On the comparison of the complexity of two methods for realizing some linear {Boolean} transformations},
     journal = {Diskretnaya Matematika},
     pages = {151--159},
     year = {1996},
     volume = {8},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1996_8_2_a10/}
}
TY  - JOUR
AU  - K. A. Zykov
TI  - On the comparison of the complexity of two methods for realizing some linear Boolean transformations
JO  - Diskretnaya Matematika
PY  - 1996
SP  - 151
EP  - 159
VL  - 8
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DM_1996_8_2_a10/
LA  - ru
ID  - DM_1996_8_2_a10
ER  - 
%0 Journal Article
%A K. A. Zykov
%T On the comparison of the complexity of two methods for realizing some linear Boolean transformations
%J Diskretnaya Matematika
%D 1996
%P 151-159
%V 8
%N 2
%U http://geodesic.mathdoc.fr/item/DM_1996_8_2_a10/
%G ru
%F DM_1996_8_2_a10
K. A. Zykov. On the comparison of the complexity of two methods for realizing some linear Boolean transformations. Diskretnaya Matematika, Tome 8 (1996) no. 2, pp. 151-159. http://geodesic.mathdoc.fr/item/DM_1996_8_2_a10/