P.: Complexity of matching problems (1987)

by D Benanav, D Kapur, Narendran
Venue:Journal of Symbolic Computation