T-tetrominoes Tiling's Markov chain mixes fast

DOI10.1016/j.tcs.2017.12.020zbMath1387.05043OpenAlexW2776839183MaRDI QIDQ1694722

Koko K. Kayibi, Shariefuddin Pirzada

Publication date: 6 February 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.12.020

zbMATH Keywords

tilingmixing time of Markov chainsfully polynomial randomized approximation schemeT-tetromino

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Polyominoes (05B50)

Related Items

GENERALIZED DOMINOES TILING'S MARKOV CHAIN MIXES FAST

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tilings of rectangles with T-tetrominoes
• Sampling contingency tables
• Planarity, symmetry and counting tilings
• Markov Chain Algorithms for Planar Lattice Structures
• Approximating the Permanent
• Covering a Rectangle with T-Tetrominoes