Title of article
On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity
Author/Authors
Paliath Narendran، نويسنده , , Andrew Marshall Hamer، نويسنده , , Bibhu Mahapatra، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
10
From page
54
To page
63
Abstract
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
Journal title
Electronic Proceedings in Theoretical Computer Science
Serial Year
2010
Journal title
Electronic Proceedings in Theoretical Computer Science
Record number
680026
Link To Document