BibTeX
CSL-JSON
MLA
Harvard
On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo
One-Sided Distributivity
release_palscwkt5zf6dnzllo2zv4zi2y
by
Paliath Narendran, Andrew Marshall
Released
as a article
.
2010
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.
In text/plain
format
Archived Files and Locations
application/pdf 217.0 kB
file_cwvxtkxpizdfdi3g4t543b4r3u
|
core.ac.uk (web) arxiv.org (repository) web.archive.org (webarchive) archive.org (archive) |
Read Archived PDF
Preserved and Accessible
arXiv
1012.4894v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links