RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive
Diskretn. Anal. Issled. Oper., Ser. 1, 2002 Volume 9, Issue 2, Pages 36–47 (Mi da174)
This article is cited in 1 paper

Estimates for the multiplicative complexity of binary words defined by concatenated Boolean functions

Yu. V. Merekin

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

UDC: 519.714

Received: 11.02.2002



Bibliographic databases:

© Steklov Math. Inst. of RAS, 2026