Dan Benanav, Deepak Kapur, Paliath Narendran. Complexity of Matching Problems. Journal of Symbolic Computation, 3(1/2):203-216, 1987.
@article{BenanavKN87,
title = {Complexity of Matching Problems},
author = {Dan Benanav and Deepak Kapur and Paliath Narendran},
year = {1987},
researchr = {https://researchr.org/publication/BenanavKN87},
cites = {0},
citedby = {0},
journal = {Journal of Symbolic Computation},
volume = {3},
number = {1/2},
pages = {203-216},
}