关于模单侧分布统一的Tander-Arnborg算法的复杂性
On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity
摘要：
我们证明了Tiden和Arnborg算法的方程统一模单侧分配性是不是多项式时间有界的，如以前所认为的。一组反例的开发表明，该算法经历了指数级的许多步骤。
英文摘要：
We prove that the Tiden and Arnborg algorithm for equational unification modulo one-sided distributivity is not polynomial time bounded as previously thought. A set of counterexamples is developed that demonstrates that the algorithm goes through exponentially many steps.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
