Geodesic
Strong naming and pseudospeedup theorems for the capacity measure of complexity
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 5 (1985), pp. 7-15.

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

@article{IVM_1985_5_a1,
     author = {M. Kh. Aizenshtein},
     title = {Strong naming and pseudospeedup theorems for the capacity measure of complexity},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {7--15},
     publisher = {mathdoc},
     number = {5},
     year = {1985},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1985_5_a1/}
}
TY  - JOUR
AU  - M. Kh. Aizenshtein
TI  - Strong naming and pseudospeedup theorems for the capacity measure of complexity
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1985
SP  - 7
EP  - 15
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_1985_5_a1/
LA  - ru
ID  - IVM_1985_5_a1
ER  - 
%0 Journal Article
%A M. Kh. Aizenshtein
%T Strong naming and pseudospeedup theorems for the capacity measure of complexity
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1985
%P 7-15
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_1985_5_a1/
%G ru
%F IVM_1985_5_a1
M. Kh. Aizenshtein. Strong naming and pseudospeedup theorems for the capacity measure of complexity. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 5 (1985), pp. 7-15. http://geodesic.mathdoc.fr/item/IVM_1985_5_a1/