Pages that link to "Item:Q537904"
From MaRDI portal
The following pages link to Computability and complexity in self-assembly (Q537904):
Displaying 13 items.
- An introduction to tile-based self-assembly and a survey of recent results (Q256961) (← links)
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- The power of duples (in self-assembly): it's not so hip to be square (Q1659998) (← links)
- Identifying shapes using self-assembly (Q1934312) (← links)
- Doubles and negatives are positive (in self-assembly) (Q2003447) (← links)
- Fractal dimension of assemblies in the abstract tile assembly model (Q2152091) (← links)
- Replication of Arbitrary Hole-Free Shapes via Self-assembly with Signal-Passing Tiles (Q2945566) (← links)
- Universality in Molecular and Cellular Computing (Q3195684) (← links)
- A Study on Complexity Measure of Diamond Tile Self-assembly System (Q5114870) (← links)
- Freezing, Bounded-Change and Convergent Cellular Automata (Q5864724) (← links)
- Geometric tiles and powers and limitations of geometric hindrance in self-assembly (Q6095490) (← links)
- Counting infinitely by oritatami co-transcriptional folding (Q6095499) (← links)
- Cold dynamics in cellular automata: a tutorial (Q6137192) (← links)
