The following pages link to (Q4313096):
Displayed 18 items.
- (Q5210579) (← links)
- GENERALIZED DOMINOES TILING'S MARKOV CHAIN MIXES FAST (Q5213496) (← links)
- (Q5239738) (← links)
- An algorithm for deciding if a polyomino tiles the plane (Q5441544) (← links)
- Primality of closed path polyominoes (Q5879295) (← links)
- Mathematical characterizations and computational complexity of anti-slide puzzles (Q5918568) (← links)
- Mathematical characterizations and computational complexity of anti-slide puzzles (Q5919108) (← links)
- Polyomino convolutions and tiling problems (Q5947369) (← links)
- Comparison of algorithms for reconstructing \(hv\)-convex discrete sets (Q5955123) (← links)
- Loops and regions in Hitomezashi patterns (Q6080150) (← links)
- On the construction of new toric quantum codes and quantum burst-error-correcting codes (Q6098268) (← links)
- Hilbert-Poincaré series and Gorenstein property for some non-simple polyominoes (Q6100743) (← links)
- Intersection graphs of maximal sub-polygons of \(k\)-lizards (Q6117086) (← links)
- An extremal graph problem on a grid and an isoperimetric problem for polyominoes (Q6126448) (← links)
- Computational complexity of jumping block puzzles (Q6144017) (← links)
- Tiling with Monotone Polyominos (Q6144634) (← links)
- Some families of $alpha$-labeled subgraphs of the integral grid (Q6155862) (← links)
- Shellable simplicial complex and switching rook polynomial of frame polyominoes (Q6199043) (← links)