%0 Journal Article
%A S. B. Gashkov
%A I. S. Sergeev
%T The complexity and depth of Boolean circuits for multiplication and inversion in some fields $GF(2^n)$
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2009
%P 3-7
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_2009_4_a0/
%G ru
%F VMUMM_2009_4_a0