Add to ORKGAbstract. Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NP- and #P-completeness) for different generalizations of dominoes in three and higher dimensions. 1
International audienceThe classical Domino problem asks whether there exists a tiling in which none ...
International audienceThe classical Domino problem asks whether there exists a tiling in which none ...
Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simp...
AbstractGames in which players build domino tilings are considered. The computational complexity of ...
For finite polyomino regions, tileability by a pair of rectangles is NP-complete for all but trivial...
AbstractGames in which players build domino tilings are considered. The computational complexity of ...
Dominoes is a popular and well-known game possibly dating back three millennia. Players are given a ...
AbstractWe are interested in the reconstruction of a domino tiling of a rectangle from its two ortho...
AbstractThis paper considers the possibility of tiling regions using dominoes. Multiply-connected pl...
(eng) In this paper, we introduce a generalization of a class of tilings which appear in the literat...
In this paper, we introduce a generalization of a class of tilings which appear in the literature: t...
In this paper, we introduce a generalization of a class of tilings which appear in the literature: t...
AbstractWe consider the problem of tiling a plane picture with dominoes, this picture can be with ho...
AbstractThe complexities of two domino problems, namely the (n,k) domain problem and the (n,k) 2-per...
International audienceThe classical Domino problem asks whether there exists a tiling in which none ...
International audienceThe classical Domino problem asks whether there exists a tiling in which none ...
International audienceThe classical Domino problem asks whether there exists a tiling in which none ...
Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simp...
AbstractGames in which players build domino tilings are considered. The computational complexity of ...
For finite polyomino regions, tileability by a pair of rectangles is NP-complete for all but trivial...
AbstractGames in which players build domino tilings are considered. The computational complexity of ...
Dominoes is a popular and well-known game possibly dating back three millennia. Players are given a ...
AbstractWe are interested in the reconstruction of a domino tiling of a rectangle from its two ortho...
AbstractThis paper considers the possibility of tiling regions using dominoes. Multiply-connected pl...
(eng) In this paper, we introduce a generalization of a class of tilings which appear in the literat...
In this paper, we introduce a generalization of a class of tilings which appear in the literature: t...
In this paper, we introduce a generalization of a class of tilings which appear in the literature: t...
AbstractWe consider the problem of tiling a plane picture with dominoes, this picture can be with ho...
AbstractThe complexities of two domino problems, namely the (n,k) domain problem and the (n,k) 2-per...
International audienceThe classical Domino problem asks whether there exists a tiling in which none ...
International audienceThe classical Domino problem asks whether there exists a tiling in which none ...
International audienceThe classical Domino problem asks whether there exists a tiling in which none ...
Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simp...