{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:05:22Z","timestamp":1742911522867,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540875307"},{"type":"electronic","value":"9783540875314"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87531-4_6","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T08:40:53Z","timestamp":1220085653000},"page":"49-63","source":"Crossref","is-referenced-by-count":2,"title":["Recursion Schemata for NC k"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Bonfante","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhard","family":"Kahle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Yves","family":"Marion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabel","family":"Oitavem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.tcs.2007.09.003","volume":"389","author":"D. Aspinall","year":"2007","unstructured":"Aspinall, D., Beringer, L., Hofmann, M., Loidl, H.-W., Momigliano, A.: A program logic for resources. Theor. Comput. Sci.\u00a0389(3), 411\u2013445 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR2","series-title":"EATCS Monographs of Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-75357-2","volume-title":"Structural complexity II","author":"J.L. Balc\u00e1zar","year":"1990","unstructured":"Balc\u00e1zar, J.L., D\u00edaz, J., Gabarr\u00f3, J.: Structural complexity II. EATCS Monographs of Theoretical Computer Science, vol.\u00a022. Springer, Heidelberg (1990)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the poly-time functions. Computational Complexity\u00a02, 97\u2013110 (1992)","journal-title":"Computational Complexity"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2003.10.021","volume":"318","author":"S. Bellantoni","year":"2004","unstructured":"Bellantoni, S., Oitavem, I.: Separating NC along the \u03b4 axis. Theoretical Computer Science\u00a0318, 57\u201378 (2004)","journal-title":"Theoretical Computer Science"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/11874683_14","volume-title":"Computer Science Logic","author":"G. Bonfante","year":"2006","unstructured":"Bonfante, G., Kahle, R., Marion, J.-Y., Oitavem, I.: Towards an implicit characterization of NC\n                  \n                    k\n                  . In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 212\u2013224. Springer, Heidelberg (2006)"},{"key":"6_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/11916277_7","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"G. Bonfante","year":"2006","unstructured":"Bonfante, G., Marion, J.-Y., P\u00e9choux, R.: A characterization of alternating log time by first order functional programs. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol.\u00a04246, pp. 90\u2013104. Springer, Heidelberg (2006)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Ko\u017een, D.J., Stockmeyer, L.J.: Alternation. Journal ACM\u00a028, 114\u2013133 (1981)","journal-title":"Journal ACM"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1998.2700","volume":"143","author":"J.-Y. Girard","year":"1998","unstructured":"Girard, J.-Y.: Light linear logic. Information and Computation\u00a0143(2), 175\u2013204 (1998)","journal-title":"Information and Computation"},{"key":"6_CR9","volume-title":"Descriptive Complexity","author":"N. Immerman","year":"1998","unstructured":"Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1998)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/11494645_33","volume-title":"New Computational Paradigms","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L., Jones, N.D.: The flow of data and the complexity of algorithms. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol.\u00a03526, pp. 263\u2013274. Springer, Heidelberg (2005)"},{"key":"6_CR11","unstructured":"Leivant, D.: A foundational delineation of computational feasiblity. In: Proceedings of the Sixth IEEE Symposium on Logic in Computer Science (LICS 1991) (1991)"},{"key":"6_CR12","first-page":"320","volume-title":"Feasible Mathematics II","author":"D. Leivant","year":"1994","unstructured":"Leivant, D.: Predicative recurrence and computational complexity I: Word recurrence and poly-time. In: Clote, P., Remmel, J. (eds.) Feasible Mathematics II, pp. 320\u2013343. Birkh\u00e4user, Basel (1994)"},{"key":"6_CR13","first-page":"716","volume-title":"Foundations of Computer Science 1998","author":"D. Leivant","year":"1998","unstructured":"Leivant, D.: A characterization of NC by tree recurrence. In: Foundations of Computer Science 1998, pp. 716\u2013724. IEEE Computer Society, Los Alamitos (1998)"},{"issue":"1\u20132","key":"6_CR14","first-page":"192","volume":"236","author":"D. Leivant","year":"2000","unstructured":"Leivant, D., Marion, J.-Y.: A characterization of alternating log time by ramified recurrence. Theoretical Computer Science\u00a0236(1\u20132), 192\u2013208 (2000)","journal-title":"Theoretical Computer Science"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-73228-0_21","volume-title":"Typed Lambda Calculi and Applications","author":"J.-Y. Marion","year":"2007","unstructured":"Marion, J.-Y.: Predicative analysis of feasibility and diagonalization. In: Della Rocca, S.R. (ed.) TLCA 2007. LNCS, vol.\u00a04583, pp. 290\u2013304. Springer, Heidelberg (2007)"},{"issue":"5","key":"6_CR16","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1137\/S0097539704445597","volume":"35","author":"K.-H. Niggl","year":"2006","unstructured":"Niggl, K.-H., Wunderlich, H.: Certifying polynomial time and linear\/polynomial space for imperative programs. SIAM J. Comput.\u00a035(5), 1122\u20131147 (2006)","journal-title":"SIAM J. Comput."},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1002\/malq.200310070","volume":"50","author":"I. Oitavem","year":"2004","unstructured":"Oitavem, I.: Characterizing NC with tier 0 pointers. Mathematical Logic Quarterly\u00a050, 9\u201317 (2004)","journal-title":"Mathematical Logic Quarterly"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","volume":"22","author":"W.L. Ruzzo","year":"1981","unstructured":"Ruzzo, W.L.: On uniform circuit complexity. Journal of Computer and System Sciences\u00a022, 365\u2013383 (1981)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01620765","volume":"27","author":"H. Simmons","year":"1988","unstructured":"Simmons, H.: The realm of primitive recursion. Archive for Mathematical Logic\u00a027, 177\u2013188 (1988)","journal-title":"Archive for Mathematical Logic"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87531-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:14:47Z","timestamp":1715058887000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87531-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540875307","9783540875314"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87531-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}