The complexity of multiple handed self-assembly
From MaRDI portal
Publication:2152075
DOI10.1007/978-3-030-87993-8_1OpenAlexW3207657815MaRDI QIDQ2152075
Timothy Gomez, David Caballero, Tim Wylie, Robert T. Schweller
Publication date: 6 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-87993-8_1
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items (2)
Complexity of verification in self-assembly with prebuilt assemblies ⋮ Unique assembly verification in two-handed self-assembly
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An introduction to tile-based self-assembly and a survey of recent results
- Strict self-assembly of fractals using multiple hands
- Finding and counting given length cycles
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
- Complexities for high-temperature two-handed tile self-assembly
- Nearly constant tile complexity for any shape in two-handed tile assembly
- Verification in staged tile self-assembly
- Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
- Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models
- Producibility in Hierarchical Self-assembly
- The program-size complexity of self-assembled squares (extended abstract)
- Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability
- Randomized Self-assembly for Approximate Shapes
- Combinatorial optimization problems in self-assembly
- Reducing tile complexity for self-assembly through temperature programming
- Subgraph Isomorphism in Planar Graphs and Related Problems
- Complexities for Generalized Models of Self-Assembly
- Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
- Randomized Self-Assembly for Exact Shapes
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: The complexity of multiple handed self-assembly
