|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2000, Volume 7, Issue 2, Pages 54–64
(Mi da262)
|
|
|
|
This article is cited in 2 scientific papers (total 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
Received: 16.12.1999
Citation:
Yu. V. Merekin, “Lower bounds for the complexity of symbol sequences defined by symmetric Boolean functions”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:2 (2000), 54–64
Linking options:
https://www.mathnet.ru/eng/da262 https://www.mathnet.ru/eng/da/v7/s1/i2/p54
|
Statistics & downloads: |
Abstract page: | 243 | Full-text PDF : | 87 |
|