Pages that link to "Item:Q527409"
From MaRDI portal
The following pages link to Binary pattern tile set synthesis is NP-hard (Q527409):
Displaying 8 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)
- Reflections on tiles (in self-assembly) (Q2311320) (← links)
- The Complexity of Fixed-Height Patterned Tile Self-assembly (Q2830225) (← links)
- (Q3448857) (redirect page) (← links)
- (Q5091013) (← links)
- Programmable single-stranded architectures for computing (Q6535757) (← links)
