Geodesic
Complexity of complete systems of equivalent transformations in programming languages
Doklady Akademii Nauk, Tome 232 (1977) no. 2, pp. 273-276.

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

@article{DAN_1977_232_2_a2,
     author = {M. I. Kanovich},
     title = {Complexity of complete systems of equivalent transformations in programming languages},
     journal = {Doklady Akademii Nauk},
     pages = {273--276},
     publisher = {mathdoc},
     volume = {232},
     number = {2},
     year = {1977},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1977_232_2_a2/}
}
TY  - JOUR
AU  - M. I. Kanovich
TI  - Complexity of complete systems of equivalent transformations in programming languages
JO  - Doklady Akademii Nauk
PY  - 1977
SP  - 273
EP  - 276
VL  - 232
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1977_232_2_a2/
LA  - ru
ID  - DAN_1977_232_2_a2
ER  - 
%0 Journal Article
%A M. I. Kanovich
%T Complexity of complete systems of equivalent transformations in programming languages
%J Doklady Akademii Nauk
%D 1977
%P 273-276
%V 232
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1977_232_2_a2/
%G ru
%F DAN_1977_232_2_a2
M. I. Kanovich. Complexity of complete systems of equivalent transformations in programming languages. Doklady Akademii Nauk, Tome 232 (1977) no. 2, pp. 273-276. http://geodesic.mathdoc.fr/item/DAN_1977_232_2_a2/