{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:24Z","timestamp":1725664704105},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540630456"},{"type":"electronic","value":"9783540690658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63045-7_5","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:00:41Z","timestamp":1330297241000},"page":"44-52","source":"Crossref","is-referenced-by-count":2,"title":["A safe recursion scheme for exponential time"],"prefix":"10.1007","author":[{"given":"Peter","family":"Clote","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"5_CR1","unstructured":"S. Bellantoni. Predicative recursion and computational complexity. Technical Report 264\/92, University of Toronto, Computer Science Department, September 1992. 164 pages."},{"key":"5_CR2","doi-asserted-by":"crossref","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:97\u2013110, 1992.","journal-title":"Computational Complexity"},{"issue":"2","key":"5_CR3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01202288","volume":"4","author":"S. Bloch","year":"1994","unstructured":"S. Bloch. Function-algebraic characterizations of log and polylog parallel time. Computational Complexity, 4(2):175\u2013205, 1994.","journal-title":"Computational Complexity"},{"key":"5_CR4","unstructured":"P. Clote. Computation models and function algebras. In E. Griffor, editor, Handbook of Recursion Theory. North Holland, in preparation."},{"key":"5_CR5","first-page":"61","volume":"3","author":"B. Morden","year":"1977","unstructured":"B. Morden. A recursive and grammatical characterization of exponential time languages. Theoretical Computer Science, 3:61\u201374, 1977.","journal-title":"Theoretical Computer Science"},{"key":"5_CR6","unstructured":"K. Wagner and G. Wechsung. Computational Complexity. Reidel Publishing Co., 1986."}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63045-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:41:23Z","timestamp":1619574083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63045-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630456","9783540690658"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-63045-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}