Geodesic
On the realization of linear Boolean operators by nonbranching programs with a conditional stop
Diskretnaya Matematika, Tome 11 (1999) no. 1, pp. 146-150.

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

The complexity of the realization of linear Boolean operators by straight-line programs with a conditional stop is considered. Exact, in order of magnitude, bounds on the average execution time of almost all such operators are found.This research was supported by the Russian Foundation for Basic Research, grant 96–01–01068, and the Federal Program ‘Integration’, grant 473. 
@article{DM_1999_11_1_a10,
     author = {A. V. Chashkin},
     title = {On the realization of linear {Boolean} operators by nonbranching programs with a conditional stop},
     journal = {Diskretnaya Matematika},
     pages = {146--150},
     publisher = {mathdoc},
     volume = {11},
     number = {1},
     year = {1999},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1999_11_1_a10/}
}
TY  - JOUR
AU  - A. V. Chashkin
TI  - On the realization of linear Boolean operators by nonbranching programs with a conditional stop
JO  - Diskretnaya Matematika
PY  - 1999
SP  - 146
EP  - 150
VL  - 11
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1999_11_1_a10/
LA  - ru
ID  - DM_1999_11_1_a10
ER  - 
%0 Journal Article
%A A. V. Chashkin
%T On the realization of linear Boolean operators by nonbranching programs with a conditional stop
%J Diskretnaya Matematika
%D 1999
%P 146-150
%V 11
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1999_11_1_a10/
%G ru
%F DM_1999_11_1_a10
A. V. Chashkin. On the realization of linear Boolean operators by nonbranching programs with a conditional stop. Diskretnaya Matematika, Tome 11 (1999) no. 1, pp. 146-150. http://geodesic.mathdoc.fr/item/DM_1999_11_1_a10/