Tiling with bars and satisfaction of Boolean formulas

European Journal of Combinatorics

Volumn 17, Issue 5, 1996, Pages 485-491

  Rémila, Eric ^a  

^a UNIVERSITÉ JEAN MONNET   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21344466743     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1996.0042     Document Type: Article

References (10)

1. B. Aspvall, M. F. Plass and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Inform. Process. Letts, 8(3) (1979), 121-123.
2. D. Beauquier, M. Nivat, E. Rémila and J. M. Robson, Tiling figures of the plane with two bars, a horizontal and a vertical one, Comput. Geom., Theory Applies (1955).
3. J. H. Conway and J. C. Lagarias, tiling with polyominoes and Combinatorial group theory, Journal of Combinatorial Theory, A, 53 (1990), 183-208.
4. J. D. Hopcroft and Karp, SIAM J. Comput., 2 (1973), 225-231.
5. C. Kenyon and R. Kenyon, Tiling a polygon with rectangles, FOCS (1992), 610-619.
6. C. Kenyon and E. Rémila, Perfect matchings in the triangular lattice, Discr. Math., to appear.
7. J. C. Lagarias and D. S. Romano, A polyomino tiling of Thurston and its configurational entropy, J. Combin. Theory, Ser. A, 63 (1993), 338-358.
8. E. Rémila, Tiling a simply connected figure with bars of length 2 or 3, Discr. Math., to appear.
9. W. P. Thurston, Conway's tiling group, Am. Math. Monthly, October (1990), 757-773.
10. 3, Rapport de stage de D.E.A. Laboratoire de l'Informatique du Parallélisme. Ecole Normale Supérieure de Lyon, 1993.