{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T23:40:10Z","timestamp":1749944410019,"version":"3.41.0"},"reference-count":8,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1993]]},"DOI":"10.1051\/ita\/1993270301751","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T15:05:42Z","timestamp":1486047942000},"page":"175-182","source":"Crossref","is-referenced-by-count":0,"title":["Limiting characterizations of low level space complexity classes"],"prefix":"10.1051","volume":"27","author":[{"given":"Mich\u00e8le","family":"Angelaccio","sequence":"first","affiliation":[]},{"given":"Marco","family":"Protasi","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"[AP90] AUSIELLO G. and PROTASI M., Limiting polynomial approximation of complexity classes, Inter. J. Found. Comp. Sci., 1, 1990, pp. 111-122.10794440726.68030","DOI":"10.1142\/S0129054190000096"},{"key":"R2","unstructured":"[APA91] AUSIELLO G., PROTASI M. 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."},{"key":"R3","unstructured":"[GJ79] GAREY M. R. and JOHNSON D. S., Computers and intractability. A guide to the theory of NP-completeness, Freeman, 1979.5190660411.68039"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"[G65] GOLD E. M., Limiting recursion, J. Symb. Log., 30, 1965, pp. 28-45.2399720203.01201","DOI":"10.2307\/2270580"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"[P65] PUTNAM H., Trial and error predicates and the solution to a problem of Mostowski's, J. Symb. Log., 30, 1965, pp. 48-57.1957250193.30102","DOI":"10.2307\/2270581"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"[S77] STOCKMEYER L. J., The polynomial-time hierarchy, Theor. Comp. Sci., 3, 1977, pp. 1-22.4388100353.02024","DOI":"10.1016\/0304-3975(76)90061-X"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"[SM73] STOCKMEYER L. J. and MEYER A. R., Words problems requiring exponential time, Proc. 5th Ann. ACM Symp. on Th. of Comp., New York, 1973, pp. 1-9.4185180359.68050","DOI":"10.1145\/800125.804029"},{"key":"R8","unstructured":"[WW85] WAGNER K. and WECHSUNG G., Computational Complexity, Reidel, 1985.8314320584.68061"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270301751\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T23:17:16Z","timestamp":1749943036000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270301751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":8,"journal-issue":{"issue":"3"},"alternative-id":["ita1993270301751"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1993270301751","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"type":"print","value":"0988-3754"},{"type":"electronic","value":"1290-385X"}],"subject":[],"published":{"date-parts":[[1993]]}}}