Fractal dimension of assemblies in the abstract tile assembly model
From MaRDI portal
Publication:2152091
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)
Cites work
- Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes
- Complexity of Self‐Assembled Shapes
- Computability and complexity in self-assembly
- Hierarchical Self-Assembly of Fractals with Signal-Passing Tiles
- Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals
- Mathematical Foundations of Computer Science 2005
- On the Computational Complexity of Algorithms
- Scaled Tree Fractals Do not Strictly Self-assemble
- Scaled pier fractals do not strictly self-assemble
- Self-assembling rulers for approximating generalized Sierpinski carpets
- Self-assembly of decidable sets
- Self-assembly of discrete self-similar fractals
- Self-assembly of infinite structures: a survey
- Self-assembly of the discrete Sierpinski carpet and related fractals
- Strict self-assembly of discrete Sierpinski triangles
- Strict self-assembly of fractals using multiple hands
- The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
- The program-size complexity of self-assembled squares (extended abstract)
- Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM
This page was built for publication: Fractal dimension of assemblies in the abstract tile assembly model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152091)
