On the exact complexity of polyomino packing
From MaRDI portal
Publication:2196557
Recommendations
Cites work
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
- Games, puzzles, and computation
- Improved lower bounds for graph embedding problems
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
- On the complexity of \(k\)-SAT
- Small polyomino packing
- Subexponential time algorithms for embedding \(H\)-minor free graphs
- Which problems have strongly exponential complexity?
Cited in
(8)- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
- On the decomposability of homogeneous binary planar configurations with respect to a given exact polyomino
- scientific article; zbMATH DE number 1122697 (Why is no real title available?)
- On the exact complexity of polyomino packing
- scientific article; zbMATH DE number 4057528 (Why is no real title available?)
- Small polyomino packing
- Packing polyominoes clumsily
- Complexity results for the horizontal bar packing problem
This page was built for publication: On the exact complexity of polyomino packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2196557)