Complexity of verification in self-assembly with prebuilt assemblies
From MaRDI portal
Publication:6156158
DOI10.1016/j.jcss.2023.03.002MaRDI QIDQ6156158
Tim Wylie, Robert T. Schweller, David Caballero, Timothy Gomez
Publication date: 12 June 2023
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
self-assembly2HAMhierarchical assemblyproducibilityassembly verificationprebuilt assembliestwo-handed assembly
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An introduction to tile-based self-assembly and a survey of recent results
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
- Freezing simulates non-freezing tile automata
- Complexities for high-temperature two-handed tile self-assembly
- Negative interactions in irreversible self-assembly
- The complexity of multiple handed self-assembly
- Covert computation in self-assembled circuits
- Self-assembly with Geometric Tiles
- Producibility in Hierarchical Self-assembly
- Combinatorial optimization problems in self-assembly
- The program-size complexity of self-assembled paths
- Computational Complexity
- Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly
This page was built for publication: Complexity of verification in self-assembly with prebuilt assemblies