𝔖 Bobbio Scriptorium

✦ LIBER ✦

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

✍ Scribed by Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu

Book ID: 118298458
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 982 KB
Volume: 18
Category: Article
ISSN: 1383-7133
DOI: 10.1007/s10601-012-9128-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE 2003 International Joint Conferenc

[IEEE 2003 International Joint Conference on Neural Networks - Portland, OR, USA (20-24 July 2003)] Proceedings of the International Joint Conference on Neural Networks, 2003. - Solving the puzzle problem using Hopfield neural network in conjunction tree search algorithm

✍ Taheri, J. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 441 KB