RUS
ENG
Full version
JOURNALS
// Diskretnaya Matematika
// Archive
Diskr. Mat.,
2018
Volume 30,
Issue 4,
Pages
88–96
(Mi dm1513)
This article is cited in
1
paper
The generalized complexity of linear Boolean functions
N. P. Red'kin
Lomonosov Moscow State University
UDC:
519.714.4
Received:
03.04.2018
DOI:
10.4213/dm1513
Fulltext:
PDF file (165 kB)
References
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2025