"Complexity of Matching Problems."

Dan Benanav, Deepak Kapur, Paliath Narendran (1987)

> Home

Details and statistics

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

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jsc/BenanavKN87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsc/BenanavKN87
Dan Benanav, Deepak Kapur, Paliath Narendran:
Complexity of Matching Problems. J. Symb. Comput. 3(1/2): 203-216 (1987)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.