Abstract
In this paper we establish several tight complexity bounds on the sequential and parallel complexity of the associative-commutative (AC) matching problem and its variants. One of our main contributions in this paper is the demonstration of a much tighter relationship between AC matching of linear terms and bipartite matching in both sequential and parallel computation. Another contribution is the use of complexity theoretic techniques to find parallelism in these problems. We believe that this approach can be successfully applied to other matching and unification problems that are not amenable to direct parallelization.
This research was supported in part by NSF under grant number CCR-8805734
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. Benanav, D. Kapur, and P. Narendran. Complexity of matching problems. In Proceedings of first Conference on Rewriting Techniques and Applications, pages 417–429, Springer Verlag, 1985.
Allan Borodin. On relating time and space to size and depth. SIAM Journal of Computing, 6(4):733–743, 1977.
C. Dwork, P. Kanellakis, and L. Stockmeyer. Parallel algorithm for term matching. In Eigth Conference on Automated Deduction, 1986.
M.R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
Andrzej Lingas and Marek Karpinski. Subtree isomorphism and bipartite perfect matching are mutually NC-reducible. In Research Report 856 — CS, Universitat Bonn, 1986.
A. Martelli and U. Montanari. An efficient unification algorithm. ACM TOPLAS, 4(2), 1982.
Ketan Mulmuley, Umesh V. Vazirani, and Vijay V. Vazirani. Matching is as easy as matrix inversion. In Proc. of Nineteenth Symposium on Theory of Computing, pages 345–354, 1987.
M.S. Paterson and M.N. Wegman. Linear unification. Journal of Computer and System Sciences, 16:158–167, 1978.
R. Ramesh, R.M. Verma, T. Krishanprasad, and I.V. Ramakrishnan. Term matching on parallel computers. In International Colloquium on Automata, Languages and Programming, pages 336–346, 1987.
Steven W. Reyner. An analysis of a good algorithm for the subtree problem. SIAM Journal of Computing, 6:730–732, 1977.
Rakesh M. Verma. An Error in Reyner's — An Analysis of a Good Algorithm for the Subtree Problem. Technical Report 88/03, S.U.N.Y. at Stony Brook Computer Science Dept., 1988.
Rakesh M. Verma and I. V. Ramakrishnan. Optimal time bounds for parallel Term Matching. In Proceedings of the Conference on Automated Deduction, pages 694–703, Springer-Verlag, 1988.
Rakesh M. Verma and I.V. Ramakrishnan. Some Complexity Theoretic Aspects of AC Rewriting. Technical Report 88/16, S.U.N.Y. at Stony Brook Computer Science Dept., 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Verma, R.M., Ramakrishnan, I.V. (1989). Some complexity theoretic aspects of AC rewriting. In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029003
Download citation
DOI: https://doi.org/10.1007/BFb0029003
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50840-3
Online ISBN: 978-3-540-46098-5
eBook Packages: Springer Book Archive