Program size and temperature in self-assembly

DOI10.1007/s00453-014-9879-3zbMath1328.68060arXiv1011.3493OpenAlexW2570929312MaRDI QIDQ494811

David Doty, Shinnosuke Seki, Ho-Lin Chen

Publication date: 2 September 2015

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

optimizationtemperatureself-assemblytile complexity

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatorial optimization (90C27)

Related Items

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

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• Strict self-assembly of discrete Sierpinski triangles
• Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
• Self-assembly with Geometric Tiles
• One-Dimensional Staged Self-assembly
• Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)
• Tile Complexity of Linear Assemblies
• The program-size complexity of self-assembled squares (extended abstract)
• Randomized Self-assembly for Approximate Shapes
• Combinatorial optimization problems in self-assembly
• Reducing tile complexity for self-assembly through temperature programming
• Step-Assembly with a Constant Number of Tile Types
• Running time and program size for self-assembled squares
• Complexities for Generalized Models of Self-Assembly
• Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
• Randomized Self-Assembly for Exact Shapes
• Complexity of Self‐Assembled Shapes