{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:09:21Z","timestamp":1725566961089},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304951"},{"type":"electronic","value":"9783540324195"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590156_43","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:43:16Z","timestamp":1133797396000},"page":"529-540","source":"Crossref","is-referenced-by-count":6,"title":["Proofs of Termination of Rewrite Systems for Polytime Functions"],"prefix":"10.1007","author":[{"given":"Toshiyasu","family":"Arai","sequence":"first","affiliation":[]},{"given":"Georg","family":"Moser","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s001530050054","volume":"36","author":"A. Beckmann","year":"1996","unstructured":"Beckmann, A., Weiermann, A.: A term rewriting characterization of the polytime functions and related complexity classes. Archive for Mathematical Logic\u00a036, 11\u201330 (1996)","journal-title":"Archive for Mathematical Logic"},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0168-0072(96)00015-2","volume":"83","author":"E.A. Cichon","year":"1997","unstructured":"Cichon, E.A., Weiermann, A.: Term rewriting theory for the primitive recursive functions. Annals of Pure and Applied Logic\u00a083, 199\u2013223 (1997)","journal-title":"Annals of Pure and Applied Logic"},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s001530200002","volume":"41","author":"I. Oitavem","year":"2002","unstructured":"Oitavem, I.: A term rewriting characterization of the functions computable in polynomal space. Archive for Mathematical Logic\u00a041, 35\u201347 (2002)","journal-title":"Archive for Mathematical Logic"},{"key":"43_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-32033-3_12","volume-title":"Term Rewriting and Applications","author":"G. Bonfante","year":"2005","unstructured":"Bonfante, G., Marion, J.Y., Moyen, J.Y.: Quasi-intepretations and small space bounds. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 150\u2013164. Springer, Heidelberg (2005)"},{"key":"43_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge Univeristy Press, New York (1998)"},{"key":"43_CR6","first-page":"1964","volume-title":"Logic, Methodology and Philosophy of Science, proceedings of the second International Congress","author":"A. Cobham","year":"1965","unstructured":"Cobham, A.: The intrinsic computational difficulty of functions. In: Bar-Hillel, Y. (ed.) Logic, Methodology and Philosophy of Science, proceedings of the second International Congress, p. 1964. North-Holland, Amsterdam (1965)"},{"key":"43_CR7","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 polytime functions. Comput. Complexity\u00a02, 97\u2013110 (1992)","journal-title":"Comput. Complexity"},{"key":"43_CR8","unstructured":"Arai, T., Moser, G.: A note on a term rewriting characterization of PTIME. In: Proc. of WST 2004, pp. 10\u201313 (2004) (extended abstract)"},{"key":"43_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0168-0072(94)00056-9","volume":"75","author":"W. Buchholz","year":"1995","unstructured":"Buchholz, W.: Proof-theoretical analysis of termination proofs. Annals of Pure and Applied Logic\u00a075, 57\u201365 (1995)","journal-title":"Annals of Pure and Applied Logic"},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(92)90289-R","volume":"105","author":"D. Hofbauer","year":"1992","unstructured":"Hofbauer, D.: Termination proofs by multiset path orderings imply primitive recursive derivation lengths. TCS\u00a0105, 129\u2013140 (1992)","journal-title":"TCS"},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0890-5401(03)00011-7","volume":"183","author":"J. Marion","year":"2003","unstructured":"Marion, J.: Analysing the implicit complexity of programs. Information and Computation\u00a0183, 2\u201318 (2003)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590156_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:49:18Z","timestamp":1619506158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590156_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304951","9783540324195"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11590156_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}