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/}
}
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/