|
|
Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2017, Number 3, Pages 16–21
(Mi vmumm65)
|
|
|
|
Mathematics
Mean computing time of Boolean operators by programs with restricted memory
A. V. Chashkin Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
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$.
Key words:
Boolean operators, average computation time, computation with bounded storage.
Received: 12.10.2016
Citation:
A. V. Chashkin, “Mean computing time of Boolean operators by programs with restricted memory”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2017, no. 3, 16–21; Moscow University Mathematics Bulletin, 72:3 (2017), 102–106
Linking options:
https://www.mathnet.ru/eng/vmumm65 https://www.mathnet.ru/eng/vmumm/y2017/i3/p16
|
|