On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:08, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of solving edge matching puzzles as SAT or CSP problems |
scientific article |
Statements
On the hardness of solving edge matching puzzles as SAT or CSP problems (English)
0 references
29 April 2015
0 references
constraints
0 references
SAT
0 references
CSP
0 references
edge matching puzzles
0 references
puzzles
0 references
phase transition
0 references
hardness
0 references
