Polynomial Path Orders

This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP*, that is applicable in two related, but distinct contexts. On the one han...

全面介紹

書目詳細資料
發表在:Logical Methods in Computer Science
Main Authors: Martin Avanzini, Georg Moser
格式: Article
語言:英语
出版: Logical Methods in Computer Science e.V. 2013-11-01
主題:
在線閱讀:https://lmcs.episciences.org/807/pdf

相似書籍