Pages that link to "Item:Q1999963"
From MaRDI portal
The following pages link to Nearly constant tile complexity for any shape in two-handed tile assembly (Q1999963):
Displaying 11 items.
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- Toward minimum size self-assembled counters (Q941685) (← links)
- The complexity of multiple handed self-assembly (Q2152075) (← links)
- On the effects of hierarchical self-assembly for reducing program-size complexity (Q2243581) (← links)
- Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract) (Q3113684) (← links)
- Tile Complexity of Linear Assemblies (Q3143302) (← links)
- Self-assembly of any shape with constant tile types using high temperature (Q5009571) (← links)
- The Two-Handed Tile Assembly Model Is Not Intrinsically Universal (Q5326578) (← links)
- Particle-based assembly using precise global control (Q5918538) (← links)
- Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D (Q6056633) (← links)
- (Q6079224) (← links)
