Pages that link to "Item:Q1346250"
From MaRDI portal
The following pages link to Tiling figures of the plane with two bars (Q1346250):
Displaying 31 items.
- Fast domino tileability (Q312152) (← links)
- The complexity of generalized domino tilings (Q396923) (← links)
- Rectangular tileability and complementary tileability are undecidable (Q740261) (← links)
- Hardness of optimal spaced seed design (Q931726) (← links)
- Tiling a simply connected figure with bars of length 2 or 3 (Q1126294) (← links)
- Tiling allowing rotations only (Q1292299) (← links)
- A characterization of recognizable picture languages by tilings by finite sets (Q1292300) (← links)
- A linear algorithm to tile the trapezes with \(h_ m\) and \(v_ n\) (Q1314412) (← links)
- Tiling pictures of the plane with dominoes (Q1356753) (← links)
- Tiling with bars under tomographic constraints. (Q1401161) (← links)
- An \(O(n \log n)\)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded. (Q1401372) (← links)
- Basic analytic combinatorics of directed lattice paths (Q1603684) (← links)
- A short scientific biography of Maurice Nivat (Q1605477) (← links)
- Tiling with bars and satisfaction of Boolean formulas (Q1922876) (← links)
- On column-convex and convex Carlitz polyominoes (Q2071544) (← links)
- The multinomial tiling model (Q2085544) (← links)
- Smooth column convex polyominoes (Q2167315) (← links)
- Covering orthogonal polygons with sliding \(k\)-transmitters (Q2310756) (← links)
- Tiling simply connected regions with rectangles (Q2349205) (← links)
- Complexity of tiling a polygon with trominoes or bars (Q2411829) (← links)
- Full sets of pictures to encode pictures (Q2422018) (← links)
- Binary nontiles (Q2902885) (← links)
- Minimum boundary touching tilings of polyominoes (Q3376538) (← links)
- Tiling a Manhattan Polyomino with Bars (Q3438939) (← links)
- A Tile with Surround Number 2 (Q4417729) (← links)
- Tiling with bars and satisfaction of boolean formulas (Q5055914) (← links)
- Enumeration of border-strip decompositions & Weil-Petersson volumes (Q5226857) (← links)
- Tilings (Q5920259) (← links)
- Tilings (Q5920621) (← links)
- Tiling with Squares and Packing Dominos in Polynomial Time (Q6051995) (← links)
- Computational complexity of counting coincidences (Q6614012) (← links)
