RUS
ENG
Full version
JOURNALS
// Diskretnaya Matematika
// Archive
Diskr. Mat.,
2013
Volume 25,
Issue 1,
Pages
3–32
(Mi dm1218)
This article is cited in
4
papers
On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
S. B. Gashkov
,
I. S. Sergeev
UDC:
519.714
Received:
14.06.2012
DOI:
10.4213/dm1218
Fulltext:
PDF file (283 kB)
References
Cited by
English version:
Discrete Mathematics and Applications, 2013,
23
:1,
1–37
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2025