Geodesic
On the complexity of the $\mathscr E^2$ Grzegorczyk class
Diskretnaya Matematika, Tome 22 (2010) no. 1, pp. 5-16

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

We define several abstract computing devices which allow us to characterise the $\mathscr E^2$ class of the Grzegorczyk hierarchy. For each of these devices, we estimate the time needed to compute functions of the class $\mathscr E^2$. 
@article{DM_2010_22_1_a1,
     author = {S. S. Marchenkov},
     title = {On the complexity of the $\mathscr E^2$ {Grzegorczyk} class},
     journal = {Diskretnaya Matematika},
     pages = {5--16},
     publisher = {mathdoc},
     volume = {22},
     number = {1},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2010_22_1_a1/}
}
TY  - JOUR
AU  - S. S. Marchenkov
TI  - On the complexity of the $\mathscr E^2$ Grzegorczyk class
JO  - Diskretnaya Matematika
PY  - 2010
SP  - 5
EP  - 16
VL  - 22
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2010_22_1_a1/
LA  - ru
ID  - DM_2010_22_1_a1
ER  - 
%0 Journal Article
%A S. S. Marchenkov
%T On the complexity of the $\mathscr E^2$ Grzegorczyk class
%J Diskretnaya Matematika
%D 2010
%P 5-16
%V 22
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2010_22_1_a1/
%G ru
%F DM_2010_22_1_a1
S. S. Marchenkov. On the complexity of the $\mathscr E^2$ Grzegorczyk class. Diskretnaya Matematika, Tome 22 (2010) no. 1, pp. 5-16. http://geodesic.mathdoc.fr/item/DM_2010_22_1_a1/