Mean computing time of Boolean operators by programs with restricted memory
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2017), pp. 16-21
Cet article a éte moissonné depuis 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},
year = {2017},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/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/
[1] Chashkin A.V., “O srednem vremeni vychisleniya znachenii bulevykh funktsii”, Diskretnyi analiz i issledovanie operatsii. Ser. 1, 4:1 (1997), 60–78 | MR | Zbl
[2] Chashkin A.V., “O srednem vremeni vychisleniya znachenii bulevykh operatorov”, Diskretnyi analiz i issledovanie operatsii. Ser. 1, 5:1 (1998), 88–103 | MR | Zbl