Tiling with bars and satisfaction of Boolean formulas

被引:2
|
作者
Remila, E [1 ]
机构
[1] UNIV ST ETIENNE,INST TECHNOL,F-42300 ROANNE,FRANCE
关键词
D O I
10.1006/eujc.1996.0042
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let F be 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. (C) 1996 Academic Press Limited
引用
收藏
页码:485 / 491
页数:7
相关论文
共 50 条
  • [1] TILING POLYGONS WITH BARS
    KENYON, C
    KENYON, R
    [J]. COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1993, 316 (12): : 1319 - 1322
  • [2] ON THE TILING OF A TORUS WITH 2 BARS
    REMILA, E
    [J]. THEORETICAL COMPUTER SCIENCE, 1994, 134 (02) : 415 - 426
  • [3] TILING FIGURES OF THE PLANE WITH 2 BARS
    BEAUQUIER, D
    NIVAT, M
    REMILA, E
    ROBSON, M
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1995, 5 (01): : 1 - 25
  • [4] Tiling with bars under tomographic constraints
    Dürr, C
    Goles, E
    Rapaport, I
    Rémila, E
    [J]. THEORETICAL COMPUTER SCIENCE, 2003, 290 (03) : 1317 - 1329
  • [5] Complexity of Tiling a Polygon with Trominoes or Bars
    Horiyama, Takashi
    Ito, Takehiro
    Nakatsuka, Keita
    Suzuki, Akira
    Uehara, Ryuhei
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2017, 58 (03) : 686 - 704
  • [6] Sensitivity of Boolean formulas
    Creignou, Nadia
    Daude, Herve
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (05) : 793 - 805
  • [7] Learning Boolean formulas
    [J]. Kearns, Michael, 1600, ACM, New York, NY, United States (41):
  • [8] BOOLEAN ALGEBRA OF FORMULAS
    FAUST, D
    HANF, W
    MYERS, D
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1977, 42 (01) : 145 - 145
  • [9] Complexity of Tiling a Polygon with Trominoes or Bars
    Takashi Horiyama
    Takehiro Ito
    Keita Nakatsuka
    Akira Suzuki
    Ryuhei Uehara
    [J]. Discrete & Computational Geometry, 2017, 58 : 686 - 704
  • [10] Boolean formulas and circuits
    不详
    [J]. COMPUTATIONAL COMPLEXITY OF EQUIVALENCE AND ISOMORPHISM PROBLEMS, 2000, 1852 : 23 - 63