Geodesic
On the implementation of monotone Boolean functions by memoryless programs
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2022), pp. 25-32

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

The average-case complexity of computing monotone Boolean functions by straight line programs without memory with a conditional stop in the basis of all Boolean functions of at most two variables is considered. For the set of all monotone Boolean functions of $n$ variables, Shannon-type upper and lower bounds for the average-case complexity are established for $n\to\infty$. 
@article{VMUMM_2022_3_a5,
     author = {A. V. Chashkin},
     title = {On the implementation of monotone {Boolean} functions by memoryless programs},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {25--32},
     publisher = {mathdoc},
     number = {3},
     year = {2022},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2022_3_a5/}
}
TY  - JOUR
AU  - A. V. Chashkin
TI  - On the implementation of monotone Boolean functions by memoryless programs
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2022
SP  - 25
EP  - 32
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2022_3_a5/
LA  - ru
ID  - VMUMM_2022_3_a5
ER  - 
%0 Journal Article
%A A. V. Chashkin
%T On the implementation of monotone Boolean functions by memoryless programs
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2022
%P 25-32
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_2022_3_a5/
%G ru
%F VMUMM_2022_3_a5
A. V. Chashkin. On the implementation of monotone Boolean functions by memoryless programs. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2022), pp. 25-32. http://geodesic.mathdoc.fr/item/VMUMM_2022_3_a5/