"Complexity of Matching Problems."

Dan Benanav, Deepak Kapur, Paliath Narendran (1987)

Details and statistics

DOI: 10.1016/S0747-7171(87)80027-5

access: open

type: Journal Article

metadata version: 2021-02-17

a service of  Schloss Dagstuhl - Leibniz Center for Informatics