|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 1999, Volume 6, Issue 3, Pages 3–9
(Mi da319)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Lower bounds for the multiplicative complexity of symbol sequences defined by monotone symmetric Boolean functions
Yu. V. Merekin Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Received: 10.03.1999
Citation:
Yu. V. Merekin, “Lower bounds for the multiplicative complexity of symbol sequences defined by monotone symmetric Boolean functions”, Diskretn. Anal. Issled. Oper., Ser. 1, 6:3 (1999), 3–9
Linking options:
https://www.mathnet.ru/eng/da319 https://www.mathnet.ru/eng/da/v6/s1/i3/p3
|
Statistics & downloads: |
Abstract page: | 169 | Full-text PDF : | 72 |
|