External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

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.

Complexity of Matching Problems

Dan Benanav, Deepak Kapur, Paliath Narendran. Complexity of Matching Problems. In Jean-Pierre Jouannaud, editor, Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings. Volume 202 of Lecture Notes in Computer Science, pages 417-429, Springer, 1985.

Abstract

Abstract is missing.

runs on