Geodesic
Lower bounds for the complexity of probabilistic binary programs with a large ordered part
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 6 (1966), pp. 95-98 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{IVM_1966_6_a9,
     author = {G. M. 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 = {95--98},
     year = {1966},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1966_6_a9/}
}
TY  - JOUR
AU  - G. M. 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  - 1966
SP  - 95
EP  - 98
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/IVM_1966_6_a9/
LA  - ru
ID  - IVM_1966_6_a9
ER  - 
%0 Journal Article
%A G. M. 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 1966
%P 95-98
%N 6
%U http://geodesic.mathdoc.fr/item/IVM_1966_6_a9/
%G ru
%F IVM_1966_6_a9
G. M. Mubarakzyanov. Lower bounds for the complexity of probabilistic binary programs with a large ordered part. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 6 (1966), pp. 95-98. http://geodesic.mathdoc.fr/item/IVM_1966_6_a9/