{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:07:34Z","timestamp":1725570454179},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175169"},{"type":"electronic","value":"9783642175176"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_27","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:13:41Z","timestamp":1291407221000},"page":"291-303","source":"Crossref","is-referenced-by-count":3,"title":["Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity"],"prefix":"10.1007","author":[{"given":"Hugo","family":"F\u00e9r\u00e9e","sequence":"first","affiliation":[]},{"given":"Emmanuel","family":"Hainry","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"Hoyrup","sequence":"additional","affiliation":[]},{"given":"Romain","family":"P\u00e9choux","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"27_CR1","first-page":"29","volume":"65","author":"R.M. Amadio","year":"2005","unstructured":"Amadio, R.M.: Synthesis of max-plus quasi-interpretations. Fundamenta Informaticae\u00a065(1), 29\u201360 (2005)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"27_CR2","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(2), 97\u2013110 (1992)","journal-title":"Computational complexity"},{"key":"27_CR3","unstructured":"Bonfante, G., Marion, J.Y., Moyen, J.Y.: Quasi-interpretations. Theor. Comput. Sci. (to appear)"},{"key":"27_CR4","unstructured":"Cobham, A.: The Intrinsic Computational Difficulty of Functions. In: Logic, methodology and philosophy of science III, p. 24. North-Holland Pub. Co., Amsterdam (1965)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Constable, R.L.: Type two computational complexity. In: Proc. 5th annual ACM STOC, pp. 108\u2013121 (1973)","DOI":"10.1145\/800125.804041"},{"issue":"4-5","key":"27_CR6","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.tcs.2009.10.014","volume":"411","author":"J. Endrullis","year":"2010","unstructured":"Endrullis, J., Grabmayer, C., Hendriks, D., Isihara, A., Klop, J.W.: Productivity of stream definitions. Theor. Comput. Sci.\u00a0411(4-5), 765\u2013782 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-04027-6_21","volume-title":"Computer Science Logic","author":"M. Gaboardi","year":"2009","unstructured":"Gaboardi, M., P\u00e9choux, R.: Upper Bounds on Stream I\/O Using Semantic Interpretations. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol.\u00a05771, pp. 271\u2013286. Springer, Heidelberg (2009)"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1017\/S0956796800003841","volume":"11","author":"R.J. Irwin","year":"2001","unstructured":"Irwin, R.J., Royer, J.S., Kapron, B.M.: On characterizations of the basic feasible functionals (Part I). J. Funct. Program.\u00a011(1), 117\u2013153 (2001)","journal-title":"J. Funct. Program."},{"issue":"1","key":"27_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/S0097539794263452","volume":"25","author":"B.M. Kapron","year":"1996","unstructured":"Kapron, B.M., Cook, S.A.: A new characterization of type-2 feasibility. SIAM Journal on Computing\u00a025(1), 117\u2013132 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity theory of real functions","author":"K.I. Ko","year":"1991","unstructured":"Ko, K.I.: Complexity theory of real functions. Birkhauser Boston Inc., Cambridge (1991)"},{"key":"27_CR11","unstructured":"Lankford, D.: On proving term rewriting systems are noetherien. Tech. Rep. (1979)"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Leivant, D., Marion, J.Y.: Lambda calculus characterizations of poly-time. In: Typed Lambda Calculi and Applications, pp. 274\u2013288 (1993)","DOI":"10.1007\/BFb0037112"},{"key":"27_CR13","unstructured":"Manna, Z., Ness, S.: On the termination of Markov algorithms. In: Third Hawaii International Conference on System Science, pp. 789\u2013792 (1970)"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/800119.803890","volume-title":"Proceedings of the Sixth Annual ACM Symposium on Theory of Computing","author":"K. Mehlhorn","year":"1974","unstructured":"Mehlhorn, K.: Polynomial and abstract subrecursive classes. In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 96\u2013109. ACM, New York (1974)"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Ramyaa, R., Leivant, D.: Feasible functions over co-inductive data. In: WoLLIC, pp. 191\u2013203 (2010)","DOI":"10.1007\/978-3-642-13824-9_16"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Seth, A.: Turing machine characterizations of feasible functionals of all finite types. In: Feasible Mathematics II, pp. 407\u2013428 (1995)","DOI":"10.1007\/978-1-4612-2566-9_14"},{"key":"27_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable analysis: an introduction","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable analysis: an introduction. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T17:00:42Z","timestamp":1553274042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}