{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T21:21:13Z","timestamp":1790198473371,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642324949","type":"print"},{"value":"9783642324956","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32495-6_1","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T07:54:08Z","timestamp":1342252448000},"page":"1-18","source":"Crossref","is-referenced-by-count":4,"title":["A Higher-Order Characterization of Probabilistic Polynomial Time"],"prefix":"10.1007","author":[{"given":"Ugo","family":"Dal Lago","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paolo","family":"Parisen Toldin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity, A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"issue":"1-3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0168-0072(00)00006-3","volume":"104","author":"S.J. Bellantoni","year":"2000","unstructured":"Bellantoni, S.J., Niggl, K.H., Schwichtenberg, H.: Higher type recursion, ramification and polynomial time. Annals of Pure and Applied Logic\u00a0104(1-3), 17\u201330 (2000)","journal-title":"Annals of Pure and Applied Logic"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bellantoni, S.: Predicative recursion and the polytime hierarchy. In: Clote, P., Remmel, J.B. (eds.) Feasible Mathematics II, pp. 15\u201329. Birkh\u00e4user (1995)","DOI":"10.1007\/978-1-4612-2566-9_2"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.A.: A new recursion-theoretic characterization of the polytime functions. Computational Complexity\u00a02, 97\u2013110 (1992)","journal-title":"Computational Complexity"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-87531-4_6","volume-title":"Computer Science Logic","author":"G. Bonfante","year":"2008","unstructured":"Bonfante, G., Kahle, R., Marion, J.-Y., Oitavem, I.: Recursion Schemata for ${\\mathit NC}^k$ . In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 49\u201363. Springer, Heidelberg (2008)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Dal Lago, U., Martini, S., Sangiorgi, D.: Light logics and higher-order processes. In: Fr\u00f6schle, S.B., Valencia, F.D. (eds.) Proceedings of the 17th International Workshop Expressiveness in Concurrency. EPTCS, vol.\u00a041 (2010)","DOI":"10.4204\/EPTCS.41.4"},{"issue":"2","key":"1_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.tcs.2009.07.045","volume":"411","author":"U. Dal Lago","year":"2010","unstructured":"Dal Lago, U., Masini, A., Zorzi, M.: Quantum implicit computational complexity. Theoretical Computer Science\u00a0411(2), 377\u2013409 (2010)","journal-title":"Theoretical Computer Science"},{"key":"1_CR8","unstructured":"Dal Lago, U., Parisen Toldin, P.: An higher-order characterization of probabilistic polynomial time (long version), http:\/\/arxiv.org\/abs\/1202.3317"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BFb0028020","volume-title":"Computer Science Logic","author":"M. Hofmann","year":"1998","unstructured":"Hofmann, M.: A Mixed Modal\/Linear Lambda Calculus with Applications to Bellantoni-Cook Safe Recursion. In: Nielsen, M., Thomas, W. (eds.) CSL 1997. LNCS, vol.\u00a01414, pp. 275\u2013294. Springer, Heidelberg (1998)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Mitchell, J.C., Mitchell, M., Scedrov, A.: A linguistic characterization of bounded oracle computation and probabilistic polynomial time. In: Proceedings of the 39th Annual Symposium Foundations of Computer Science, pp. 725\u2013733. IEEE Computer Society (1998)","DOI":"10.1109\/SFCS.1998.743523"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(98)00357-0","volume":"228","author":"N.D. Jones","year":"1999","unstructured":"Jones, N.D.: Logspace and ptime characterized by programming languages. Theoretical Computer Science\u00a0228, 151\u2013174 (1999)","journal-title":"Theoretical Computer Science"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Leivant, D.: Stratified functional programs and computational complexity. In: Proceedings of the 20th International Symposium Principles of Programming Languages, pp. 325\u2013333. ACM (1993)","DOI":"10.1145\/158511.158659"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/BFb0022277","volume-title":"Computer Science Logic","author":"D. Leivant","year":"1995","unstructured":"Leivant, D., Marion, J.-Y.: Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol.\u00a0933, pp. 486\u2013500. Springer, Heidelberg (1995)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Schwichtenberg, H., Bellantoni, S.: Feasible computation with higher types. In: Proof and System-Reliability, pp. 399\u2013415. Kluwer Academic Publishers (2001)","DOI":"10.1007\/978-94-010-0413-8_13"},{"issue":"5","key":"1_CR15","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1017\/S0960129510000265","volume":"20","author":"Y. Zhang","year":"2010","unstructured":"Zhang, Y.: The computational SLR: a logic for reasoning about computational indistinguishability. Mathematical Structures in Computer Science\u00a020(5), 951\u2013975 (2010)","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundational and Practical Aspects of Resource Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32495-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T04:04:41Z","timestamp":1743739481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32495-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642324949","9783642324956"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32495-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}