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.
@inproceedings{BenanavKN85,
title = {Complexity of Matching Problems},
author = {Dan Benanav and Deepak Kapur and Paliath Narendran},
year = {1985},
researchr = {https://researchr.org/publication/BenanavKN85},
cites = {0},
citedby = {0},
pages = {417-429},
booktitle = {Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings},
editor = {Jean-Pierre Jouannaud},
volume = {202},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-15976-2},
}