Pages that link to "Item:Q3401089"
From MaRDI portal
The following pages link to Approximability of Edge Matching Puzzles (Q3401089):
Displaying 6 items.
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity (Q2373445) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- Edge-Matching Problems with Rotations (Q3088275) (← links)
- A guide-and-observe hyper-heuristic approach to the Eternity II puzzle (Q5891176) (← links)
- A guide-and-observe hyper-heuristic approach to the Eternity II puzzle (Q5919987) (← links)