Computability and Complexity in Self-assembly

DOI10.1007/978-3-540-69407-6_38zbMath1142.68352OpenAlexW1568884392MaRDI QIDQ3507449

James I. Lathrop, Scott M. Summers, Jack H. Lutz, Matthew J. Patitz

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_38

zbMATH Keywords

computational complexitycomputabilitymolecular computingself-assembly

Mathematics Subject Classification ID

Related Items (6)

Self-assembly of infinite structures: a survey ⋮ A Limit to the Power of Multiple Nucleation in Self-assembly ⋮ Self-assembly of Decidable Sets ⋮ Size-separable tile self-assembly: a tight bound for temperature-1 mismatch-free systems ⋮ Distributed agreement in tile self-assembly ⋮ Self-assembly of Discrete Self-similar Fractals

Cites Work

• Unnamed Item
• Unnamed Item
• The program-size complexity of self-assembled squares (extended abstract)
• On the Computational Complexity of Algorithms
• Strict Self-assembly of Discrete Sierpinski Triangles
• Complexity of Self‐Assembled Shapes

This page was built for publication: Computability and Complexity in Self-assembly