Tiling with bars and satisfaction of Boolean formulas

DOI10.1006/EUJC.1996.0042zbMath0863.05024OpenAlexW1989161236MaRDI QIDQ1922876

Eric Rémila

Publication date: 23 March 1997

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1996.0042

zbMATH Keywords

tilingsquaresNP-hardnessbarspolyominoes3-satisfiabilitylinear algorithmplane figuresplane tessellation

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)

Related Items (1)

Complexity of tiling a polygon with trominoes or bars

This page was built for publication: Tiling with bars and satisfaction of Boolean formulas