Geodesic
On the mean time for computing the values of elementary Boolean functions
Diskretnaya Matematika, Tome 12 (2000) no. 4, pp. 109-120 
A. V. Chashkin. On the mean time for computing the values of elementary Boolean functions. Diskretnaya Matematika, Tome 12 (2000) no. 4, pp. 109-120. http://geodesic.mathdoc.fr/item/DM_2000_12_4_a8/
@article{DM_2000_12_4_a8,
     author = {A. V. Chashkin},
     title = {On the mean time for computing the values of elementary {Boolean} functions},
     journal = {Diskretnaya Matematika},
     pages = {109--120},
     year = {2000},
     volume = {12},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2000_12_4_a8/}
}
TY  - JOUR
AU  - A. V. Chashkin
TI  - On the mean time for computing the values of elementary Boolean functions
JO  - Diskretnaya Matematika
PY  - 2000
SP  - 109
EP  - 120
VL  - 12
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/DM_2000_12_4_a8/
LA  - ru
ID  - DM_2000_12_4_a8
ER  - 
%0 Journal Article
%A A. V. Chashkin
%T On the mean time for computing the values of elementary Boolean functions
%J Diskretnaya Matematika
%D 2000
%P 109-120
%V 12
%N 4
%U http://geodesic.mathdoc.fr/item/DM_2000_12_4_a8/
%G ru
%F DM_2000_12_4_a8

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

The disjunction, conjunction, and linear function, each depending on an increasing number of arguments, are computed by straight-line programs with a conditional stop. Asymptotically exact formulas for the average-case complexity of these functions are found. It is shown that the average-case complexities of disjunction and conjunction are constants and the average-case complexity of the linear function coincides with its circuit size. The research was supported by the Russian Foundation for Basic Research, grant 99-01-01175, and the Federal Program 'Integration', grant 473.

[1] Lupanov O. B., Asimptoticheskie otsenki slozhnosti upravlyayuschikh sistem, Izd-vo Mosk. un-ta, Moskva, 1984

[2] Chashkin A. V., “O srednem vremeni vychisleniya znachenii bulevykh funktsii”, Diskretnyi analiz i issledovanie operatsii, 4:1 (1997), 60–78 | MR | Zbl

[3] Chashkin A. V., “O vychislenii bulevykh funktsii veroyatnostnymi programmami”, Diskretnyi analiz i issledovanie operatsii, 4:3 (1997), 49–68 | MR

[4] Chashkin A. V., “O srednem vremeni vychisleniya znachenii bulevykh operatorov”, Diskretnyi analiz i issledovanie operatsii, 5:1 (1998), 88–103 | MR | Zbl

[5] Chashkin A. V., “O srednem vremeni vychisleniya polinomialno svodimykh bulevykh funktsii”, Vestnik Mosk. un-ta. Seriya I Mat. Mekh., 1998, no. 1, 68–71 | MR

[6] Chashkin A. V., “O realizatsii lineinykh bulevykh operatorov nevetvyaschimisya programmami s uslovnoi ostanovkoi”, Diskretnaya matematika, 11:1 (1999), 146–150 | MR | Zbl