20 citations · 30 across the 20 of their papers we have counts for
Showing 2014 · cs.CCShow all
2 papers · 2 filters
cs.CC2014
Computing Minimum Tile Sets to Self-Assemble Colors Patterns
Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki
Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely self-assemble a given rectangular color pattern. For , -PATS is a varia…
cs.CC2014★ 2 cited
Binary pattern tile set synthesis is NP-hard
Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier +2
In the field of algorithmic self-assembly, a long-standing unproven conjecture has been that of the NP-hardness of binary pattern tile set synthesis (2-PATS). The -PATS problem…