Geodesic
On the comparison of the complexities of binary $k$-programs
Diskretnyj analiz i issledovanie operacij, Tome 2 (1995) no. 4, pp. 54-73
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DA_1995_2_4_a4,
     author = {E. A. Okolnishnikova},
     title = {On the comparison of the complexities of binary $k$-programs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {54--73},
     year = {1995},
     volume = {2},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1995_2_4_a4/}
}
TY  - JOUR
AU  - E. A. Okolnishnikova
TI  - On the comparison of the complexities of binary $k$-programs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1995
SP  - 54
EP  - 73
VL  - 2
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/DA_1995_2_4_a4/
LA  - ru
ID  - DA_1995_2_4_a4
ER  - 
%0 Journal Article
%A E. A. Okolnishnikova
%T On the comparison of the complexities of binary $k$-programs
%J Diskretnyj analiz i issledovanie operacij
%D 1995
%P 54-73
%V 2
%N 4
%U http://geodesic.mathdoc.fr/item/DA_1995_2_4_a4/
%G ru
%F DA_1995_2_4_a4
E. A. Okolnishnikova. On the comparison of the complexities of binary $k$-programs. Diskretnyj analiz i issledovanie operacij, Tome 2 (1995) no. 4, pp. 54-73. http://geodesic.mathdoc.fr/item/DA_1995_2_4_a4/