Computability and Complexity in Self-assembly

DOI10.1007/978-3-540-69407-6_38MaRDI QIDQ3507449zbMATH OpenOpenAlexFDO

Authors James I. Lathrop, Jack H. Lutz, Scott M. Summers, 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

computabilitycomputational complexitymolecular computingself-assembly

Mathematics Subject Classification ID

Recommendations

• Computability and complexity in self-assembly
• Self-assembly of decidable sets
• Self-assembly of Decidable Sets
• Complexity of Self‐Assembled Shapes
• DNA Computing

Cites work

• Complexity of Self‐Assembled Shapes
• scientific article; zbMATH DE number 2086605 (Why is no real title available?)
• scientific article; zbMATH DE number 3222108 (Why is no real title available?)
• On the Computational Complexity of Algorithms
• Strict Self-assembly of Discrete Sierpinski Triangles
• The program-size complexity of self-assembled squares (extended abstract)

Cited in

(13)

• Complexity classes for self-assembling flexible tiles
• On the effects of hierarchical self-assembly for reducing program-size complexity
• Computation = self-assembly + conformational change: Toward new computing paradigms.
• scientific article; zbMATH DE number 6351478 (Why is no real title available?)
• The program-size complexity of self-assembled squares (extended abstract)
• A Limit to the Power of Multiple Nucleation in Self-assembly
• Self-assembly of Decidable Sets
• Self-assembly of Discrete Self-similar Fractals
• Complexities for Generalized Models of Self-Assembly
• Computability and complexity in self-assembly
• Complexity of Self‐Assembled Shapes
• Self-assembly of decidable sets
• Self-assembly of infinite structures: a survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507449)