Complexities for generalized models of self-assembly
From MaRDI portal
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Recommendations
Cited in
(29)- Producibility in hierarchical self-assembly
- New bounds on the tile complexity of thin rectangles at temperature-1
- Turing patterns with Turing machines: emergence and low-level structure formation
- Covert computation in self-assembled circuits
- Self-assembly with geometric tiles
- The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems
- Identifying shapes using self-assembly (extended abstract)
- scientific article; zbMATH DE number 6351478 (Why is no real title available?)
- Size-dependent tile self-assembly: constant-height rectangles and stability
- A Limit to the Power of Multiple Nucleation in Self-assembly
- Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems
- A Self-assembly Model of Time-Dependent Glue Strength
- Complexity of Compact Proofreading for Self-assembled Patterns
- The undecidability of the infinite ribbon problem: implications for computing by self-assembly
- Program size and temperature in self-assembly
- Covert computation in self-assembled circuits
- A study on complexity measure of diamond tile self-assembly system
- Self-attraction removal from oritatami systems
- Complexities for Generalized Models of Self-Assembly
- The power of nondeterminism in self-assembly
- Complexity of Self‐Assembled Shapes
- DNA Computing
- Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D
- Verification and computation in restricted tile automata
- Building squares with optimal state complexity in restricted active self-assembly
- Self-assembly of infinite structures: a survey
- Complexity of graph self-assembly in accretive systems and self-destructible systems
- On the complexity of graph self-assembly in accretive systems
- Toward minimum size self-assembled counters
This page was built for publication: Complexities for generalized models of self-assembly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501350)
