{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:22Z","timestamp":1760202682853,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>This paper is concerned with the complexity analysis of constructor term\nrewrite systems and its ramification in implicit computational complexity. We\nintroduce a path order with multiset status, the polynomial path order POP*,\nthat is applicable in two related, but distinct contexts. On the one hand POP*\ninduces polynomial innermost runtime complexity and hence may serve as a\nsyntactic, and fully automatable, method to analyse the innermost runtime\ncomplexity of term rewrite systems. On the other hand POP* provides an\norder-theoretic characterisation of the polytime computable functions: the\npolytime computable functions are exactly the functions computable by an\northogonal constructor TRS compatible with POP*.<\/jats:p>","DOI":"10.2168\/lmcs-9(4:9)2013","type":"journal-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T09:37:51Z","timestamp":1405417071000},"source":"Crossref","is-referenced-by-count":7,"title":["Polynomial Path Orders"],"prefix":"10.46298","volume":"Volume 9, Issue 4","author":[{"given":"Martin","family":"Avanzini","sequence":"first","affiliation":[]},{"given":"Georg","family":"Moser","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2013,11,1]]},"reference":[{"key":"799:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/807\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/807\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:56:33Z","timestamp":1681242993000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,1]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-9(4:9)2013","relation":{"is-same-as":[{"id-type":"arxiv","id":"1309.2394","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1309.2394","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"doi","id":"10.1093\/logcom\/exz026","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2013,11,1]]},"article-number":"807"}}