Geodesic
Complexity of a system of linear Boolean function
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2025), pp. 76-79

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

The complexity of computing systems of linear Boolean functions by circuits in the linear basis $\{\oplus \}$ is considered. A tight value of the complexity of the system of linear Boolean functions with a coefficient matrix coinciding with a Hadamard matrix is established. 
@article{VMUMM_2025_2_a11,
     author = {A. V. Chashkin},
     title = {Complexity of a system of linear {Boolean} function},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {76--79},
     publisher = {mathdoc},
     number = {2},
     year = {2025},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2025_2_a11/}
}
TY  - JOUR
AU  - A. V. Chashkin
TI  - Complexity of a system of linear Boolean function
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2025
SP  - 76
EP  - 79
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2025_2_a11/
LA  - ru
ID  - VMUMM_2025_2_a11
ER  - 
%0 Journal Article
%A A. V. Chashkin
%T Complexity of a system of linear Boolean function
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2025
%P 76-79
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_2025_2_a11/
%G ru
%F VMUMM_2025_2_a11
A. V. Chashkin. Complexity of a system of linear Boolean function. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2025), pp. 76-79. http://geodesic.mathdoc.fr/item/VMUMM_2025_2_a11/