RUS
ENG
Full version
JOURNALS
// Diskretnyi Analiz i Issledovanie Operatsii
// Archive
Diskretn. Anal. Issled. Oper., Ser. 1,
2004
Volume 11,
Issue 3,
Pages
3–15
(Mi da108)
This article is cited in
2
papers
On the mean complexity of Boolean functions defined by Zhegalkin polynomials
R. N. Zabaluev
M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
UDC:
519.7
Received:
15.04.2004
Fulltext:
PDF file (238 kB)
References
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2024
Fulltext:
PDF file (238 kB)