|
This article is cited in 4 scientific papers (total in 4 papers)
On the complexity of the $\mathscr E^2$ Grzegorczyk class
S. S. Marchenkov
Abstract:
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$.
Received: 15.09.2009
Citation:
S. S. Marchenkov, “On the complexity of the $\mathscr E^2$ Grzegorczyk class”, Diskr. Mat., 22:1 (2010), 5–16; Discrete Math. Appl., 20:1 (2010), 61–73
Linking options:
https://www.mathnet.ru/eng/dm1081https://doi.org/10.4213/dm1081 https://www.mathnet.ru/eng/dm/v22/i1/p5
|
Statistics & downloads: |
Abstract page: | 676 | Full-text PDF : | 299 | References: | 64 | First page: | 28 |
|