Limiting characterizations of low level space complexity classes
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993) no. 3, pp. 175-182. 
@article{ITA_1993__27_3_175_0,
     author = {Angelaccio, Mich\`ele and Protasi, Marco},
     title = {Limiting characterizations of low level space complexity classes},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {175--182},
     publisher = {EDP-Sciences},
     volume = {27},
     number = {3},
     year = {1993},
     mrnumber = {1227942},
     zbl = {0785.68037},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1993__27_3_175_0/}
}
TY  - JOUR
AU  - Angelaccio, Michèle
AU  - Protasi, Marco
TI  - Limiting characterizations of low level space complexity classes
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1993
SP  - 175
EP  - 182
VL  - 27
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1993__27_3_175_0/
LA  - en
ID  - ITA_1993__27_3_175_0
ER  - 
%0 Journal Article
%A Angelaccio, Michèle
%A Protasi, Marco
%T Limiting characterizations of low level space complexity classes
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1993
%P 175-182
%V 27
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1993__27_3_175_0/
%G en
%F ITA_1993__27_3_175_0
Angelaccio, Michèle; Protasi, Marco. Limiting characterizations of low level space complexity classes. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993) no. 3, pp. 175-182. http://archive.numdam.org/item/ITA_1993__27_3_175_0/

[AP90] G. Ausiello and M. Protasi, Limiting polynomial approximation of complexity classes, Inter. J. Found. Comp. Sci., 1, 1990, pp. 111-122. | MR | Zbl

[APA91] G. Ausiello, M. Protasi and Angelaccio, A characterization of space complexity classes and subexponential time classes as limiting polynomially decidable sets, Tech. Rep., 91-46, International Computer Science Institute, Berkeley, 1991.

[GJ79] M. R. Garey and D. S. Johnson, Computers and intractability. A guide to the theory of NP-completeness, Freeman, 1979. | MR | Zbl

[G65] E. M. Gold, Limiting recursion, J. Symb. Log., 30, 1965, pp. 28-45. | MR | Zbl

[P65] H. Putnam, Trial and error predicates and the solution to a problem of Mostowski's, J. Symb. Log., 30, 1965, pp. 48-57. | MR | Zbl

[S77] L. J. Stockmeyer, The polynomial-time hierarchy, Theor. Comp. Sci., 3, 1977, pp. 1-22. | MR | Zbl

[SM73] L. J. Stockmeyer and A. R. Meyer, Words problems requiring exponential time, Proc. 5th Ann. ACM Symp. on Th. of Comp., New York, 1973, pp. 1-9. | MR | Zbl

[WW85] K. Wagner and G. Wechsung, Computational Complexity, Reidel, 1985. | MR | Zbl