Optimal Program-Size Complexity for Self-Assembly at Temperature 1 in 3D

DOI10.1007/978-3-319-21999-8_5zbMath1364.68195arXiv1411.1122OpenAlexW1760628847MaRDI QIDQ2948409

Scott M. Summers, David Furcy, Samuel Micka

Publication date: 30 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.1122

Mathematics Subject Classification ID

Related Items (2)

Optimal self-assembly of finite shapes at temperature 1 in 3D ⋮ Optimal staged self-assembly of general shapes

Cites Work

• Unnamed Item
• Limitations of self-assembly at temperature 1
• The program-size complexity of self-assembled squares (extended abstract)
• Running time and program size for self-assembled squares
• Complexity of Self‐Assembled Shapes
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: Optimal Program-Size Complexity for Self-Assembly at Temperature 1 in 3D