1. Some combinatorial game problems require Ω(nk) time;Adachi;J. ACM,1984
2. The undecidability of the domino problem;Berger;Mem. Amer. Math. Soc.,1966
3. Domino-tiling games;Chlebus;J. Comput. System Sci.,1986
4. Proving NP-completeness using bounded tiling;Chlebus;J. Inform. Process. Cybernet. EIK,1987
5. Domino games with an application to the complexity of Boolean algebras with bounded quantifier alternations;Gradel;Proc. Symp. Theoretical Aspects of Computer Science,1988