3 citations · 5 across the 3 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2010★ 3 cited
On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity
Paliath Narendran, Andrew Marshall, Bibhu Mahapatra
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 counterexamp…
cs.SC2010
Unification modulo a partial theory of exponentiation
Deepak Kapur, Andrew Marshall, Paliath Narendran
Modular exponentiation is a common mathematical operation in modern cryptography. This, along with modular multiplication at the base and exponent levels (to different moduli) play…