Geodesic
On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic~2
Diskretnaya Matematika, Tome 25 (2013) no. 1, pp. 3-32

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

@article{DM_2013_25_1_a0,
     author = {S. B. Gashkov and I. S. Sergeev},
     title = {On complexity and depth of {Boolean} circuits for multiplication and inversion over finite fields of characteristic~2},
     journal = {Diskretnaya Matematika},
     pages = {3--32},
     publisher = {mathdoc},
     volume = {25},
     number = {1},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2013_25_1_a0/}
}
TY  - JOUR
AU  - S. B. Gashkov
AU  - I. S. Sergeev
TI  - On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic~2
JO  - Diskretnaya Matematika
PY  - 2013
SP  - 3
EP  - 32
VL  - 25
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2013_25_1_a0/
LA  - ru
ID  - DM_2013_25_1_a0
ER  - 
%0 Journal Article
%A S. B. Gashkov
%A I. S. Sergeev
%T On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic~2
%J Diskretnaya Matematika
%D 2013
%P 3-32
%V 25
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2013_25_1_a0/
%G ru
%F DM_2013_25_1_a0
S. B. Gashkov; I. S. Sergeev. On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic~2. Diskretnaya Matematika, Tome 25 (2013) no. 1, pp. 3-32. http://geodesic.mathdoc.fr/item/DM_2013_25_1_a0/