Geodesic
Complexity of the realization of a~linear Boolean function in the class of $\pi$-schemes
Diskretnyj analiz i issledovanie operacij, Tome 25 (2018) no. 3, pp. 36-94

Voir la notice de l'article provenant de la source Math-Net.Ru

Using Khrapchenko's method, we obtain the exact lower bound of 40 for the complexity in the class of $\pi$-schemes of a linear Boolean function depending substantially on 6 variables. We give a simplified proof of several lower bounds for the complexity of linear Boolean functions which are previously obtained on the basis of the same method. Bibliogr. 18.
Keywords: Boolean function, $\pi$-scheme, lower complexity bound. 
@article{DA_2018_25_3_a2,
     author = {K. L. Rychkov},
     title = {Complexity of the realization of a~linear {Boolean} function in the class of $\pi$-schemes},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {36--94},
     publisher = {mathdoc},
     volume = {25},
     number = {3},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2018_25_3_a2/}
}
TY  - JOUR
AU  - K. L. Rychkov
TI  - Complexity of the realization of a~linear Boolean function in the class of $\pi$-schemes
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2018
SP  - 36
EP  - 94
VL  - 25
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2018_25_3_a2/
LA  - ru
ID  - DA_2018_25_3_a2
ER  - 
%0 Journal Article
%A K. L. Rychkov
%T Complexity of the realization of a~linear Boolean function in the class of $\pi$-schemes
%J Diskretnyj analiz i issledovanie operacij
%D 2018
%P 36-94
%V 25
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2018_25_3_a2/
%G ru
%F DA_2018_25_3_a2
K. L. Rychkov. Complexity of the realization of a~linear Boolean function in the class of $\pi$-schemes. Diskretnyj analiz i issledovanie operacij, Tome 25 (2018) no. 3, pp. 36-94. http://geodesic.mathdoc.fr/item/DA_2018_25_3_a2/