Geodesic
The capabilities of probabilistic ordered read-$k$-times binary programs and deterministic read-once binary programs are incomparable
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 11 (2005), pp. 34-43

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

@article{IVM_2005_11_a5,
     author = {R. G. Mubarakzyanov},
     title = {The capabilities of probabilistic ordered read-$k$-times binary programs and deterministic read-once binary programs are incomparable},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {34--43},
     publisher = {mathdoc},
     number = {11},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2005_11_a5/}
}
TY  - JOUR
AU  - R. G. Mubarakzyanov
TI  - The capabilities of probabilistic ordered read-$k$-times binary programs and deterministic read-once binary programs are incomparable
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2005
SP  - 34
EP  - 43
IS  - 11
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2005_11_a5/
LA  - ru
ID  - IVM_2005_11_a5
ER  - 
%0 Journal Article
%A R. G. Mubarakzyanov
%T The capabilities of probabilistic ordered read-$k$-times binary programs and deterministic read-once binary programs are incomparable
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2005
%P 34-43
%N 11
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2005_11_a5/
%G ru
%F IVM_2005_11_a5
R. G. Mubarakzyanov. The capabilities of probabilistic ordered read-$k$-times binary programs and deterministic read-once binary programs are incomparable. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 11 (2005), pp. 34-43. http://geodesic.mathdoc.fr/item/IVM_2005_11_a5/