{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:53:41Z","timestamp":1725494021719},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671596"},{"type":"electronic","value":"9783540465218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46521-9_20","type":"book-chapter","created":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T18:47:16Z","timestamp":1194115636000},"page":"239-252","source":"Crossref","is-referenced-by-count":1,"title":["Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes"],"prefix":"10.1007","author":[{"given":"Emanuele","family":"Covino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Pani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvatore","family":"Caporaso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,2,14]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"S.J. Bellantoni, Predicative recursion and the polytime hierarchy, in P.Clote and J.Remmel (eds), Feasible Mathematics II (Birkauser, 1994), 320\u2013343.","DOI":"10.1007\/978-1-4612-2566-9_2"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"S. Bellantoni and S. Cook, A new recursion-theoretic characterization of the polytime functions, Computational Complexity 2(1992)97\u2013110.","journal-title":"Computational Complexity"},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1142\/S012905419600018X","volume":"7","author":"S. Caporaso","year":"1996","unstructured":"S. Caporaso, Safe Turing machines, Grzegorczyc classes and polytime, Intern. J. Found. Comp. Sc., 73(1996)241\u2013252.","journal-title":"Intern. J. Found. Comp. Sc."},{"key":"20_CR4","unstructured":"S. Caporaso, N. Galesi, M. Zito, A predicative and decidable characterization of the polytime classes of languages, to appear in Theoretical Comp. Sc."},{"key":"20_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-62592-5_61","volume-title":"Algorithms and Complexity","author":"S. Caporaso","year":"1997","unstructured":"S. Caporaso, M. Zito, N. Galesi, E. Covino Syntactic characterization in Lisp of the polynomial complexity classes and hierarchies, in G. Bongiovanni, D.P. Bovet, G. Di Battista (eds), Algorithms and Complexity, LNCS 1203(1997)61\u201373."},{"key":"20_CR6","unstructured":"S. Caporaso, G. Pani, E. Covino, Predicative recursion, constructive diagonalization and the elementary functions, Workshop on Implicit Computational Complexity (ICC99), affiliated with LICS99, Trento, 1999."},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02835830","volume":"25","author":"P. Clote","year":"1992","unstructured":"P. Clote, A time-space hierarchy between polynomial time and polynomial space, Math. Sys. The. 25(1992)77\u201392.","journal-title":"Math. Sys. The."},{"key":"20_CR8","unstructured":"A. Cobham, The intrinsic computational difficulty of functions, in Y. Bar-Hillel (ed), Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science, pages 24\u201330, North-Holland, Amsterdam, 1962."},{"issue":"4","key":"20_CR9","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/321356.321362","volume":"13","author":"F.C. Hennie","year":"1966","unstructured":"F.C. Hennie and R.E. Stearns, Two-tape simulation of multi-tapes TM\u2019s, Journal of ACM 134(1966)533\u2013546.","journal-title":"Journal of ACM"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"D. Leivant, A foundational delineation of computational feasibility, Proc. of the 6th Annual IEEE symposium on Logic in Computer Science, (IEEE Computer Society Press, 1991), 2\u201318.","DOI":"10.1109\/LICS.1991.151625"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"D. Leivant, Stratified functional programs and computational complexity, in Conference Records of the 20th Annual ACM Symposium on Principles of Programming Languages, New York, 1993, ACM.","DOI":"10.1145\/158511.158659"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"D. Leivant, Ramified recurrence and computational complexity I: word recurrence and polytime, in P. Clote and J. Remmel (eds), Feasible Mathematics II (Birkauser, 1994), 320\u2013343.","DOI":"10.1007\/978-1-4612-2566-9_11"},{"key":"20_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/BFb0022277","volume-title":"Computer Science Logic","author":"D. Leivant","year":"1995","unstructured":"D. Leivant and J.-Y. Marion, Ramified recurrence and computational complexity II: substitution and polyspace, in J. Tiuryn and L. Pocholsky (eds), Computer Science Logic, LNCS 933(1995) 486\u2013500."},{"issue":"1","key":"20_CR14","first-page":"109","volume":"10","author":"I. Oitavem","year":"1997","unstructured":"I. Oitavem, New recursive characterization of the elementary functions and the functions computable in polynomial space, Revista Matematica de la Universidad Complutense de Madrid, 101(1997)109\u2013125.","journal-title":"New recursive characterization of the elementary functions and the functions computable in polynomial space"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"R.W. Ritchie, Classes of predictable computable functions, Transactions of A.M.S., 106, 1993.","DOI":"10.2307\/1993719"},{"key":"20_CR16","volume-title":"Subrecursion: Functions and hierarchies","author":"H.E. Rose","year":"1984","unstructured":"H.E. Rose, Subrecursion: Functions and hierarchies, Oxford University Press, Oxford, 1984."},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01620765","volume":"27","author":"H. Simmons","year":"1988","unstructured":"H. Simmons, The realm of primitive recursion, Arch.Math. Logic, 27(1988)177\u2013188.","journal-title":"Arch.Math. Logic"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46521-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T00:44:39Z","timestamp":1556930679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46521-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671596","9783540465218"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-46521-9_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}