RUS
ENG
Full version
JOURNALS
// Diskretnaya Matematika
// Archive
Diskr. Mat.,
2011
Volume 23,
Issue 4,
Pages
80–102
(Mi dm1163)
This article is cited in
3
papers
The best asymptotic representation of Boolean functions by information graphs
Yu. S. Shutkin
UDC:
519.7
Received:
25.06.2010
DOI:
10.4213/dm1163
Fulltext:
PDF file (742 kB)
References
Cited by
English version:
Discrete Mathematics and Applications, 2011,
21
:5-6,
675–700
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2026