Regular Article
Tiling with Bars and Satisfaction of Boolean Formulas

https://doi.org/10.1006/eujc.1996.0042Get rights and content
Under an Elsevier user license
open archive

Abstract

LetFbe a figure formed from a finite set of cells of the planar square lattice. We first prove that the problem of tiling such a figure with bars formed from 2 or 3 cells can be reduced to the logic problem 2-SAT. Afterwards, we deduce a linear-time algorithm of tiling with these bars.

Cited by (0)