Geodesic
Lower bounds for the complexity of probabilistic binary programs with a large ordered part
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 6 (2006), pp. 56-64

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

@article{IVM_2006_6_a5,
     author = {R. G. Mubarakzyanov},
     title = {Lower bounds for the complexity of probabilistic binary programs with a large ordered part},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {56--64},
     publisher = {mathdoc},
     number = {6},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2006_6_a5/}
}
TY  - JOUR
AU  - R. G. Mubarakzyanov
TI  - Lower bounds for the complexity of probabilistic binary programs with a large ordered part
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2006
SP  - 56
EP  - 64
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2006_6_a5/
LA  - ru
ID  - IVM_2006_6_a5
ER  - 
%0 Journal Article
%A R. G. Mubarakzyanov
%T Lower bounds for the complexity of probabilistic binary programs with a large ordered part
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2006
%P 56-64
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2006_6_a5/
%G ru
%F IVM_2006_6_a5
R. G. Mubarakzyanov. Lower bounds for the complexity of probabilistic binary programs with a large ordered part. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 6 (2006), pp. 56-64. http://geodesic.mathdoc.fr/item/IVM_2006_6_a5/