The complexity of the reduction of algorithms
Doklady Akademii Nauk, Tome 186 (1969) no. 5, pp. 1008-1009.

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

@article{DAN_1969_186_5_a5,
     author = {M. I. Kanovich},
     title = {The complexity of the reduction of algorithms},
     journal = {Doklady Akademii Nauk},
     pages = {1008--1009},
     publisher = {mathdoc},
     volume = {186},
     number = {5},
     year = {1969},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1969_186_5_a5/}
}
TY  - JOUR
AU  - M. I. Kanovich
TI  - The complexity of the reduction of algorithms
JO  - Doklady Akademii Nauk
PY  - 1969
SP  - 1008
EP  - 1009
VL  - 186
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1969_186_5_a5/
LA  - ru
ID  - DAN_1969_186_5_a5
ER  - 
%0 Journal Article
%A M. I. Kanovich
%T The complexity of the reduction of algorithms
%J Doklady Akademii Nauk
%D 1969
%P 1008-1009
%V 186
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1969_186_5_a5/
%G ru
%F DAN_1969_186_5_a5
M. I. Kanovich. The complexity of the reduction of algorithms. Doklady Akademii Nauk, Tome 186 (1969) no. 5, pp. 1008-1009. http://geodesic.mathdoc.fr/item/DAN_1969_186_5_a5/