Hard and easy instances of L-tromino tilings
DOI10.1007/978-3-030-10564-8_7zbMath1434.68593arXiv1710.04640OpenAlexW3195881359MaRDI QIDQ5919658
Manjil Pratim Saikia, Javier T. Akagi, Marcos Villagra, Carlos F. Gaona, Fabricio Mendoza
Publication date: 15 October 2019
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.04640
NP-completenessclaw-free graphsAztec diamondtrominopolyomino tilingsAztec rectangleefficient tilings
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Polyominoes (05B50)
Related Items (1)
This page was built for publication: Hard and easy instances of L-tromino tilings
