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.
Dan Benanav, Deepak Kapur, Paliath Narendran. Complexity of Matching Problems. Journal of Symbolic Computation, 3(1/2):203-216, 1987.