Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Deepak Kapur, Paliath Narendran. Matching, unification and complexity. ACM Comm. Computer Algebra, 21(4):6-9, 1987. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Complexity of Nilpotent Unification and Matching ProblemsQing Guo, Paliath Narendran, David A. Wolfram. iandc, 162(1-2):3-23, 2000.
The following publications are possibly variants of this publication: