Verification in staged tile self-assembly

DOI10.1007/978-3-319-58187-3_8zbMath1486.68068arXiv1703.04598OpenAlexW2604920800MaRDI QIDQ2400952

Tim Wylie, Andrew Winslow, Robert T. Schweller

Publication date: 31 August 2017

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

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

zbMATH Keywords

DNA computingbiocomputing2HAMDNA-computing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (4)

The complexity of multiple handed self-assembly ⋮ Simulation of multiple stages in single bin active tile self-assembly ⋮ Unique assembly verification in two-handed self-assembly ⋮ Optimal staged self-assembly of linear assemblies

Cites Work

• New geometric algorithms for fully connected staged self-assembly
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• The polynomial-time hierarchy
• Complexities for high-temperature two-handed tile self-assembly
• Staged self-assembly and polyomino context-free grammars
• Producibility in Hierarchical Self-assembly
• One-Dimensional Staged Self-assembly
• Combinatorial optimization problems in self-assembly
• Complexities for Generalized Models of Self-Assembly
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Verification in staged tile self-assembly