RUS
ENG
Full version
JOURNALS
// Diskretnyi Analiz i Issledovanie Operatsii
// Archive
Diskretn. Anal. Issled. Oper., Ser. 1,
1997
Volume 4,
Issue 2,
Pages
75–111
(Mi da394)
This article is cited in
2
papers
Lower bounds on complexity of restrictions of Boolean functions
A. V. Chashkin
M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
UDC:
519.7
Received:
07.04.1997
Fulltext:
PDF file (3188 kB)
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2024
Fulltext:
PDF file (3188 kB)