Pages that link to "Item:Q2373445"
From MaRDI portal
The following pages link to Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity (Q2373445):
Displaying 25 items.
- Irregular polyomino tiling via integer programming with application in phased array antenna design (Q288219) (← links)
- Rectangle packing with additional restrictions (Q650936) (← links)
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles (Q1799950) (← links)
- Hierarchical fragmented image reassembly using a bundle-of-superpixel representation (Q2010297) (← links)
- On the exact complexity of polyomino packing (Q2196557) (← links)
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (Q2196563) (← links)
- Symmetric assembly puzzles are hard, beyond a few pieces (Q2206733) (← links)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- No easy puzzles: hardness results for jigsaw puzzles (Q2346997) (← links)
- Small polyomino packing (Q2361496) (← links)
- Spherical quadratic equations in free metabelian groups (Q2790248) (← links)
- Dissection with the Fewest Pieces is Hard, Even to Approximate (Q2958085) (← links)
- Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces (Q2958100) (← links)
- Edge-Matching Problems with Rotations (Q3088275) (← links)
- On the Exact Complexity of Polyomino Packing (Q3305727) (← links)
- Games, Puzzles and Treewidth (Q5042461) (← links)
- Solving Jigsaw Puzzles by the Graph Connection Laplacian (Q5143313) (← links)
- A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles (Q5219322) (← links)
- A Global Approach for Solving Edge-Matching Puzzles (Q5250017) (← links)
- A guide-and-observe hyper-heuristic approach to the Eternity II puzzle (Q5891176) (← links)
- Hard and easy instances of L-tromino tilings (Q5919532) (← links)
- A guide-and-observe hyper-heuristic approach to the Eternity II puzzle (Q5919987) (← links)
- An integer linear programming approach to solving the Eternity puzzle (Q6076354) (← links)
- Computational complexity of puzzles and related topics (Q6535387) (← links)
- Comprehensive survey of the solving puzzle problems (Q6580684) (← links)
