On the hardness of solving edge matching puzzles as SAT or CSP problems DOI: 10.1007/s10601-012-9128-9 AuthorsCarlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu Constraints 18(1), January 2013 Publication dateWednesday, January 2, 2013 - 12:00