RUS
ENG
Full version
JOURNALS
// Diskretnyi Analiz i Issledovanie Operatsii
// Archive
Diskretn. Anal. Issled. Oper., Ser. 1,
2005
Volume 12,
Issue 2,
Pages
56–72
(Mi da65)
This article is cited in
3
papers
On the complexity of realization of Boolean functions by formulas
A. V. Chashkin
M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
UDC:
519.71
Received:
10.12.2004
Fulltext:
PDF file (271 kB)
References
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2025