相依对与多项式路序
Dependency Pairs and Polynomial Path Orders
摘要：
我们展示了如何多项式路径顺序可以有效地结合弱最内层依赖对自动认证多项式的长期重写系统的运行时复杂性和计算的函数的多时间可计算性。所建立的技术已经实施，我们提供了充足的实验数据来评估新方法。
英文摘要：
We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term rewrite systems and the polytime computability of the functions computed. The established techniques have been implemented and we provide ample experimental data to assess the new method.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
