Pages that link to "Item:Q5384017"
From MaRDI portal
The following pages link to Intrinsic universality in tile self-assembly requires cooperation (Q5384017):
Displayed 26 items.
- An introduction to tile-based self-assembly and a survey of recent results (Q256961) (← links)
- The two-handed tile assembly model is not intrinsically universal (Q262271) (← links)
- Strict self-assembly of fractals using multiple hands (Q334941) (← links)
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- Optimal self-assembly of finite shapes at temperature 1 in 3D (Q1635717) (← links)
- The power of duples (in self-assembly): it's not so hip to be square (Q1659998) (← links)
- Nearly constant tile complexity for any shape in two-handed tile assembly (Q1999963) (← links)
- Doubles and negatives are positive (in self-assembly) (Q2003447) (← links)
- Fast arithmetic in algorithmic self-assembly (Q2003452) (← links)
- Size-separable tile self-assembly: a tight bound for temperature-1 mismatch-free systems (Q2003454) (← links)
- Parallel computation using active self-assembly (Q2003467) (← links)
- Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D (Q2034770) (← links)
- Scaled pier fractals do not strictly self-assemble (Q2311321) (← links)
- Self-assembly of 4-sided fractals in the two-handed tile assembly model (Q2400953) (← links)
- On the complexity of two-dimensional signed majority cellular automata (Q2409572) (← links)
- Unraveling simplicity in elementary cellular automata (Q2628772) (← links)
- Scaled Tree Fractals Do not Strictly Self-assemble (Q2945529) (← links)
- The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems (Q2945884) (← links)
- Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D (Q6056633) (← links)
- Resiliency to multiple nucleation in temperature-1 self-assembly (Q6061980) (← links)
- Geometric tiles and powers and limitations of geometric hindrance in self-assembly (Q6095490) (← links)
- Communication complexity meets cellular automata: necessary conditions for intrinsic universality (Q6095497) (← links)
- Building squares with optimal state complexity in restricted active self-assembly (Q6133652) (← links)
- Tight bounds on the directed tile complexity of a just-barely 3D \(2 \times N\) rectangle at temperature 1 (Q6149118) (← links)
- Particle computation: complexity, algorithms, and logic (Q6150976) (← links)
- The need for seed (in the abstract Tile Assembly Model) (Q6185943) (← links)