On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity
Symbolic Computation
2010-12-23 v1 Logic in Computer Science
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.
Cite
@article{arxiv.1012.4894,
title = {On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity},
author = {Paliath Narendran and Andrew Marshall and Bibhu Mahapatra},
journal= {arXiv preprint arXiv:1012.4894},
year = {2010}
}
Comments
In Proceedings UNIF 2010, arXiv:1012.4554