{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:41:00Z","timestamp":1725795660361},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_26","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T04:37:49Z","timestamp":1402461469000},"page":"305-317","source":"Crossref","is-referenced-by-count":6,"title":["Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus"],"prefix":"10.1007","author":[{"given":"Damiano","family":"Mazza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity \u2013 A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"issue":"1","key":"26_CR2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/504077.504081","volume":"3","author":"A. Asperti","year":"2002","unstructured":"Asperti, A., Roversi, L.: Intuitionistic light affine logic. ACM Trans. Comput. Log.\u00a03(1), 137\u2013175 (2002)","journal-title":"ACM Trans. Comput. Log."},{"key":"26_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.: A new recursion-theoretic characterization of the polytime functions. Computational Complexity\u00a02, 97\u2013110 (1992)","journal-title":"Computational Complexity"},{"key":"26_CR4","unstructured":"Bourbaki, N.: General Topology, ch. 1-4. Springer (1998)"},{"issue":"2","key":"26_CR5","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. Inf. Comput.\u00a0143(2), 175\u2013204 (1998)","journal-title":"Inf. Comput."},{"issue":"1-2","key":"26_CR6","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. Theor. Comput. Sci.\u00a0228(1-2), 151\u2013174 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"26_CR7","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1093\/logcom\/10.3.411","volume":"10","author":"A.J. Kfoury","year":"2000","unstructured":"Kfoury, A.J.: A linearization of the lambda-calculus and consequences. J. Log. Comput.\u00a010(3), 411\u2013436 (2000)","journal-title":"J. Log. Comput."},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/990518.990519","volume":"6","author":"R.E. Ladner","year":"1975","unstructured":"Ladner, R.E.: The circuit value problem is log-space complete for P. SIGACT News\u00a06(2), 18\u201320 (1975)","journal-title":"SIGACT News"},{"issue":"1-2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tcs.2003.10.018","volume":"318","author":"Y. Lafont","year":"2004","unstructured":"Lafont, Y.: Soft linear logic and polynomial time. Theor. Comput. Sci.\u00a0318(1-2), 163\u2013180 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Leivant, D., Marion, J.Y.: Lambda calculus characterizations of poly-time. Fundam. Inform. 19(1\/2) (1993)","DOI":"10.3233\/FI-1993-191-207"},{"issue":"6","key":"26_CR11","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1017\/S0956796804005131","volume":"14","author":"H.G. Mairson","year":"2004","unstructured":"Mairson, H.G.: Linear lambda calculus and ptime-completeness. J. Funct. Program.\u00a014(6), 623\u2013633 (2004)","journal-title":"J. Funct. Program."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Mazza, D.: An infinitary affine lambda-calculus isomorphic to the full lambda-calculus. In: Proceedings of LICS, pp. 471\u2013480 (2012)","DOI":"10.1109\/LICS.2012.57"},{"issue":"2-3","key":"26_CR13","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.tcs.2006.01.016","volume":"358","author":"P.A. Melli\u00e8s","year":"2006","unstructured":"Melli\u00e8s, P.A.: Asynchronous games 2: The true concurrency of innocence. Theor. Comput. Sci.\u00a0358(2-3), 200\u2013228 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR14","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Terui, K.: Proof nets and boolean circuits. In: Proceedings of LICS, pp. 182\u2013191 (2004)","DOI":"10.1109\/LICS.2004.1319612"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,7]],"date-time":"2022-04-07T13:45:46Z","timestamp":1649339146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}