Paliath Narendran (University at Albany-SUNY) |
Andrew Marshall (University at Albany-SUNY) |
Bibhu Mahapatra (University at Albany-SUNY) |
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. |
ArXived at: https://dx.doi.org/10.4204/EPTCS.42.5 | bibtex | |
Comments and questions to: eptcs@eptcs.org |
For website issues: webmaster@eptcs.org |