Geodesic
Certain theorems on the complexity of normal algorithms and computations
Doklady Akademii Nauk, Tome 184 (1969) no. 6, pp. 1275-1276 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DAN_1969_184_6_a3,
     author = {M. I. Kanovitch and N. V. Petri},
     title = {Certain theorems on the complexity of normal algorithms and computations},
     journal = {Doklady Akademii Nauk},
     pages = {1275--1276},
     year = {1969},
     volume = {184},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1969_184_6_a3/}
}
TY  - JOUR
AU  - M. I. Kanovitch
AU  - N. V. Petri
TI  - Certain theorems on the complexity of normal algorithms and computations
JO  - Doklady Akademii Nauk
PY  - 1969
SP  - 1275
EP  - 1276
VL  - 184
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/DAN_1969_184_6_a3/
LA  - ru
ID  - DAN_1969_184_6_a3
ER  - 
%0 Journal Article
%A M. I. Kanovitch
%A N. V. Petri
%T Certain theorems on the complexity of normal algorithms and computations
%J Doklady Akademii Nauk
%D 1969
%P 1275-1276
%V 184
%N 6
%U http://geodesic.mathdoc.fr/item/DAN_1969_184_6_a3/
%G ru
%F DAN_1969_184_6_a3
M. I. Kanovitch; N. V. Petri. Certain theorems on the complexity of normal algorithms and computations. Doklady Akademii Nauk, Tome 184 (1969) no. 6, pp. 1275-1276. http://geodesic.mathdoc.fr/item/DAN_1969_184_6_a3/