RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive
Diskretn. Anal. Issled. Oper., Ser. 1, 1998 Volume 5, Issue 3, Pages 38–43 (Mi da360)
This article is cited in 1 paper

Upper bounds for the complexity of symbol sequences generated by symmetric Boolean functions

Yu. V. Merekin

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

UDC: 519.714

Received: 10.02.1998



Bibliographic databases:

© Steklov Math. Inst. of RAS, 2026