Pages that link to "Item:Q2872134"
From MaRDI portal
The following pages link to Computing Minimum Tile Sets to Self-Assemble Color Patterns (Q2872134):
Displayed 4 items.
- 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)
- 3-color bounded patterned self-assembly (Q2003474) (← links)
- The Complexity of Fixed-Height Patterned Tile Self-assembly (Q2830225) (← links)