# Parallel algorithms for term matching

SIAM J. Comput., pp. 711-731, 1988.

EI

Keywords:

parallel algorithmterm matchingunificationparallel algorithmslogic programming

Abstract:

We present a new randomized parallel algorithm for term matching. Let n be the number of nodes of the directed acyclic graphs (dags) representing the terms to be matched, then our algorithm uses O(log2n) parallel time and M(n) processors, where M(n) is the complexity of n by n matrix multiplication. The number of processors is a significa...More

Code:

Data:

Tags

Comments