A minimal requirement for self-assembly of lines in polylogarithmic time

DOI10.1007/S11047-018-9695-9zbMath1528.68127OpenAlexW4253072854MaRDI QIDQ6062023

Yen-Ru Chin, Jui-Ting Tsai, Ho-Lin Chen

Publication date: 30 November 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-018-9695-9

zbMATH Keywords

exponential growthself-assemblylimited state changesnubot model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other nonclassical models of computation (68Q09)

Cites Work

• Unnamed Item
• Autonomous programmable DNA nanorobotic devices using DNAzymes
• A minimal requirement for self-assembly of lines in polylogarithmic time
• Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation
• Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
• The program-size complexity of self-assembled squares (extended abstract)
• Reducing tile complexity for self-assembly through temperature programming
• Running time and program size for self-assembled squares
• Randomized Self-Assembly for Exact Shapes
• Complexity of Self‐Assembled Shapes

This page was built for publication: A minimal requirement for self-assembly of lines in polylogarithmic time