par Fekete, Sandor;Schweller, Robert R.T.;Winslow, Andrew 
Référence Lecture notes in computer science, 9472, page (296-306)
Publication Publié, 2015
Référence Lecture notes in computer science, 9472, page (296-306)
Publication Publié, 2015
Article révisé par les pairs
| Résumé : | We introduce a new model of algorithmic tile self-assembly called size-dependent assembly. In previous models, supertiles are stable when the total strength of the bonds between any two halves exceeds some constant temperature. In this model, this constant temperature requirement is replaced by an nondecreasing temperature function τ : (Formula presented.) that depends on the size of the smaller of the two halves. This generalization allows supertiles to become unstable and break apart, and captures the increased forces that large structures may place on the bonds holding them together. We demonstrate the power of this model in two ways. First, we give fixed tile sets that assemble constant-height rectangles and squares of arbitrary input size given an appropriate temperature function. Second, we prove that deciding whether a supertile is stable is coNP-complete. Both results contrast with known results for fixed temperature. |
