RUS
ENG
Full version
JOURNALS
// Diskretnyi Analiz i Issledovanie Operatsii
// Archive
Diskretn. Anal. Issled. Oper., Ser. 1,
2000
Volume 7,
Issue 2,
Pages
54–64
(Mi da262)
This article is cited in
2
papers
Lower bounds for the complexity of symbol sequences defined by symmetric Boolean functions
Yu. V. Merekin
Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
UDC:
519.714
Received:
16.12.1999
Fulltext:
PDF file (1116 kB)
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2026
Fulltext:
PDF file (1116 kB)