Nearly constant tile complexity for any shape in two-handed tile assembly

DOI10.1007/s00453-019-00573-wzbMath1425.68115OpenAlexW2939716717WikidataQ128051736 ScholiaQ128051736MaRDI QIDQ1999963

Andrew Winslow, Tim Wylie, Robert T. Schweller

Publication date: 27 June 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-019-00573-w

zbMATH Keywords

self-assembly2HAMhierarchical assembly

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (4)

The complexity of multiple handed self-assembly ⋮ Unnamed Item ⋮ On the effects of hierarchical self-assembly for reducing program-size complexity ⋮ Particle-based assembly using precise global control

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Program size and temperature in self-assembly
• Complexities for high-temperature two-handed tile self-assembly
• Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
• The program-size complexity of self-assembled squares (extended abstract)
• Programmable Control of Nucleation for Algorithmic Self-Assembly
• Limitations of Self-assembly at Temperature One
• Running time and program size for self-assembled squares
• Complexities for Generalized Models of Self-Assembly
• The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
• Intrinsic universality in tile self-assembly requires cooperation
• On the Behavior of Tile Assembly System at High Temperatures
• Complexity of Self‐Assembled Shapes

This page was built for publication: Nearly constant tile complexity for any shape in two-handed tile assembly