Publication:1635717

DOI10.1007/s00453-016-0260-6zbMath1394.68142arXiv1507.06365OpenAlexW2565088752MaRDI QIDQ1635717

David Furcy, Scott M. Summers

Publication date: 1 June 2018

Published in: Algorithmica, Combinatorial Optimization and Applications (Search for Journal in Brave)

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

zbMATH Keywords

Kolmogorov complexityoptimal encodingself-assemblyalgorithmic self-assemblynon-cooperative self-assemblyoptimal self-assemblyscaled shapestemperature 1

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other nonclassical models of computation (68Q09)

Related Items

Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D, Resiliency to multiple nucleation in temperature-1 self-assembly, Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limitations of self-assembly at temperature 1
• Resiliency to Multiple Nucleation in Temperature-1 Self-Assembly
• Optimal Program-Size Complexity for Self-Assembly at Temperature 1 in 3D
• Intrinsic Universality in Self-Assembly
• The program-size complexity of self-assembled squares (extended abstract)
• Complexity of Compact Proofreading for Self-assembled Patterns
• Polyomino-Safe DNA Self-assembly via Block Replacement
• Running time and program size for self-assembled squares
• Complexities for Generalized Models of Self-Assembly
• Intrinsic universality in tile self-assembly requires cooperation
• Complexity of Self‐Assembled Shapes
• DNA Computing
• DNA Computing
• An introduction to Kolmogorov complexity and its applications