Rectangular tileability and complementary tileability are undecidable
Author:
- Jed YangJYJed Yang
- 1 October 2014
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 41, 20-34
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation (DGE-0707424)
This publication has 29 references indexed in Scilit:
- Tilings*The Mathematical Intelligencer, 2010
- An algorithm for deciding if a polyomino tiles the planeRAIRO - Theoretical Informatics and Applications, 2007
- A codicity undecidable problem in the planeTheoretical Computer Science, 2003
- Successful visual human-computer interaction is undecidableInformation Processing Letters, 1998
- Quaquaversal tilings and rotationsInventiones Mathematicae, 1998
- An aperiodic set of 13 Wang tilesDiscrete Mathematics, 1996
- Tiling figures of the plane with two barsComputational Geometry, 1995
- On translating one polyomino to tile the planeDiscrete & Computational Geometry, 1991
- Tiling with polyominoes and combinatorial group theoryJournal of Combinatorial Theory, Series A, 1990
- Tiling with sets of polyominoesJournal of Combinatorial Theory, 1970