Complexity of verification in self-assembly with prebuilt assemblies

DOI10.1016/J.JCSS.2023.03.002MaRDI QIDQ6156158zbMATH OpenFDO

Authors David Caballero, Timothy Gomez, Robert T. Schweller, Tim Wylie

Publication date 12 June 2023

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCSS.2023.03.002

zbMATH Keywords

2HAMassembly verificationhierarchical assemblyprebuilt assembliesproducibilityself-assemblytwo-handed assembly

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• An introduction to tile-based self-assembly and a survey of recent results
• Combinatorial optimization problems in self-assembly
• Complexities for high-temperature two-handed tile self-assembly
• Computational Complexity
• Covert computation in self-assembled circuits
• Freezing simulates non-freezing tile automata
• scientific article; zbMATH DE number 7740878 (Why is no real title available?)
• Intrinsic universality and the computational power of self-assembly
• Producibility in hierarchical self-assembly
• Self-assembly with geometric tiles
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• The complexity of multiple handed self-assembly
• The program-size complexity of self-assembled paths
• Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM
• Universal computation with arbitrary polyomino tiles in non-cooperative self-assembly

Cited in

(2)

• On the effects of hierarchical self-assembly for reducing program-size complexity
• Unique assembly verification in two-handed self-assembly

This page was built for publication: Complexity of verification in self-assembly with prebuilt assemblies

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