The program-size complexity of self-assembled squares (extended abstract)
From MaRDI portal
Publication:3192015
Recommendations
- Running time and program size for self-assembled squares
- Optimal program-size complexity for self-assembled squares at temperature 1 in 3D
- The program-size complexity of self-assembled paths
- Complexity of Compact Proofreading for Self-assembled Patterns
- Optimal program-size complexity for self-assembly at temperature 1 in 3D
- On the effects of hierarchical self-assembly for reducing program-size complexity
- Computability and complexity in self-assembly
- Computability and Complexity in Self-assembly
- Complexity classes for self-assembling flexible tiles
Cited in
(only showing first 100 items - show all)- Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
- DNA Computing
- Error suppression mechanisms for DNA tile self-assembly and their simulation
- Exploring programmable self-assembly in non-DNA based molecular computing
- Polyomino-Safe DNA Self-assembly via Block Replacement
- Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes
- Program size and temperature in self-assembly
- Robust Self-assembly of Graphs
- On the complexity of asynchronous freezing cellular automata
- Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
- Enumeration approach to computing chemical equilibria
- Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
- A Self-assembly Model of Time-Dependent Glue Strength
- Limitations of self-assembly at temperature 1
- Search methods for tile sets in patterned DNA self-assembly
- Less haste, less waste: on recycling and its limits in strand displacement systems
- Localized hybridization circuits
- Resiliency to multiple nucleation in temperature-1 self-assembly
- Self-assembling rulers for approximating generalized Sierpinski carpets
- Resiliency to multiple nucleation in temperature-1 self-assembly
- Arithmetic computation in the tile assembly model: addition and multiplication
- Step-wise tile assembly with a constant number of tile types
- Hierarchical self assembly of patterns from the Robinson tilings: DNA tile design in an enhanced tile assembly model
- Simple evolution of complex crystal species
- Self-correcting Self-assembly: Growth Models and the Hammersley Process
- Running time and program size for self-assembled squares
- Solving NP-complete problems in the tile assembly model
- Self-assembly of infinite structures: a survey
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
- On the transformation capability of feasible mechanisms for programmable matter
- Toward minimum size self-assembled counters
- Nearly constant tile complexity for any shape in two-handed tile assembly
- Parallelism and time in hierarchical self-assembly
- Computability and Complexity in Self-assembly
- 3-color bounded patterned self-assembly (extended abstract)
- Tile complexity of approximate squares
- On stoichiometry for the assembly of flexible tile DNA complexes
- 3-color bounded patterned self-assembly
- Flipping tiles: concentration independent coin flips in tile self-assembly
- An introduction to tile-based self-assembly and a survey of recent results
- Turing patterns with Turing machines: emergence and low-level structure formation
- Polyomino-safe DNA self-assembly via block replacement
- Optimizing tile concentrations to minimize errors and time for DNA tile self-assembly systems
- A Limit to the Power of Multiple Nucleation in Self-assembly
- Self-assembly of Decidable Sets
- Computability and complexity in self-assembly
- Self-assembly of discrete self-similar fractals
- Parallel Computation Using Active Self-assembly
- Efficient 3-SAT algorithms in the tile assembly model
- Complexity classes for self-assembling flexible tiles
- Strict self-assembly of discrete Sierpinski triangles
- Exact shapes and Turing universality at temperature 1 with a single negative glue
- Synthesizing small and reliable tile sets for patterned DNA self-assembly
- Pictures worth a thousand tiles, a geometrical programming language for self-assembly
- On the complexity of graph self-assembly in accretive systems
- Optimal program-size complexity for self-assembled squares at temperature 1 in 3D
- Identifying shapes using self-assembly
- Connectivity preserving network transformers
- Complexity of graph self-assembly in accretive systems and self-destructible systems
- Triangular and hexagonal tile self-assembly systems
- Self-assembly of decidable sets
- Polyominoes simulating arbitrary-neighborhood zippers and tilings
- Concentration independent random number generation in tile self-assembly
- Efficient algorithms for self assembling non-rectangular nano structures
- On aggregation in multiset-based self-assembly of graphs
- Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions
- The emerging discipline of biomolecular computation in the US
- Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D
- Nondeterministic polynomial time factoring in the tile assembly model
- Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems
- Complexity of Compact Proofreading for Self-assembled Patterns
- Self-assembly of Discrete Self-similar Fractals
- A minimal requirement for self-assembly of lines in polylogarithmic time
- Universal computation and optimal construction in the chemical reaction network-controlled tile assembly model
- Path finding in the tile assembly model
- Tight bounds on the directed tile complexity of a just-barely 3D \(2 \times N\) rectangle at temperature 1
- Self-assembly of any shape with constant tile types using high temperature
- Transformations and Preservation of Self-assembly Dynamics through Homotheties
- Terminating distributed construction of shapes and patterns in a fair solution of automata
- Network Constructors: A Model for Programmable Matter
- The power of duples (in self-assembly): it's not so hip to be square
- The need for seed (in the abstract Tile Assembly Model)
- Producibility in hierarchical self-assembly
- Counting infinitely by oritatami co-transcriptional folding
- Expectation and Variance of Self-assembled Graph Structures
- Non-cooperative algorithms in self-assembly
- Centralised connectivity-preserving transformations by rotation: 3 musketeers for all orthogonal convex shapes
- Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
- Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- On geometric shape construction via growth operations
- Towards composable computations by RNA co-transcriptional folding: a proof-of-concept demonstration of nested loops in oritatami
- Non-explosivity of stochastically modeled reaction networks that are complex balanced
- Geometric tiles and powers and limitations of geometric hindrance in self-assembly
- The impacts of dimensionality, diffusion, and directedness on intrinsic cross-model simulation in tile-based self-assembly
- On the effects of hierarchical self-assembly for reducing program-size complexity
- Tilt assembly: algorithms for micro-factories that build objects with uniform external forces
- A brief tour of theoretical tile self-assembly
- Fractal dimension of assemblies in the abstract tile assembly model
- The complexity of multiple handed self-assembly
This page was built for publication: The program-size complexity of self-assembled squares (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192015)
