"On the hardness of solving edge matching puzzles as SAT or CSP problems."

Carlos Ansótegui et al. (2013)

> Home

Details and statistics

DOI: 10.1007/S10601-012-9128-9

access: closed

type: Journal Article

metadata version: 2020-03-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/constraints/AnsoteguiBFM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/constraints/AnsoteguiBFM13
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu:
On the hardness of solving edge matching puzzles as SAT or CSP problems. Constraints An Int. J. 18(1): 7-37 (2013)

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.