On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10601-012-9128-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2046346504 / rank | |||
Normal rank | |||
Revision as of 19:35, 19 March 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
