RUS
ENG
Full version
JOURNALS
// Diskretnyi Analiz i Issledovanie Operatsii
// Archive
Diskretn. Anal. Issled. Oper., Ser. 1,
2000
Volume 7,
Issue 3,
Pages
86–98
(Mi da273)
This article is cited in
3
papers
Lower bounds for the formula complexity of symmetric Boolean functions
D. Yu. Cherukhin
M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
UDC:
519.176
Received:
23.06.2000
Fulltext:
PDF file (1183 kB)
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2024
Fulltext:
PDF file (1183 kB)