Pages that link to "Item:Q5300928"
From MaRDI portal
The following pages link to Combinatorial Optimization in Pattern Assembly (Q5300928):
Displaying 10 items.
- An introduction to tile-based self-assembly and a survey of recent results (Q256961) (← links)
- Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly (Q391179) (← links)
- Search methods for tile sets in patterned DNA self-assembly (Q395021) (← links)
- A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis (Q511695) (← links)
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- Optimization for automated assembly of puzzles (Q621731) (← links)
- Constructing patterns of (many) ESSs under support size control (Q831065) (← links)
- 3-color bounded patterned self-assembly (Q2003474) (← links)
- The Complexity of Fixed-Height Patterned Tile Self-assembly (Q2830225) (← links)
- 3-Color Bounded Patterned Self-assembly (Q5168502) (← links)