Geodesic
Mean computing time of Boolean operators by programs with restricted memory
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2017), pp. 16-21

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

The average time of computing the values of Boolean operators by straight-line programs with a conditional stop and storage of at most $D$ is studied. As the number $n$ of variables grows, for almost all Boolean operators with $m$ components, an asymptotically tight formula for the average computation time is obtained in a wide range of $D$ and $m$. 
@article{VMUMM_2017_3_a2,
     author = {A. V. Chashkin},
     title = {Mean computing time of {Boolean} operators by programs with restricted memory},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {16--21},
     publisher = {mathdoc},
     number = {3},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2017_3_a2/}
}
TY  - JOUR
AU  - A. V. Chashkin
TI  - Mean computing time of Boolean operators by programs with restricted memory
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2017
SP  - 16
EP  - 21
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2017_3_a2/
LA  - ru
ID  - VMUMM_2017_3_a2
ER  - 
%0 Journal Article
%A A. V. Chashkin
%T Mean computing time of Boolean operators by programs with restricted memory
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2017
%P 16-21
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_2017_3_a2/
%G ru
%F VMUMM_2017_3_a2
A. V. Chashkin. Mean computing time of Boolean operators by programs with restricted memory. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2017), pp. 16-21. http://geodesic.mathdoc.fr/item/VMUMM_2017_3_a2/