6 citations · 9 across the 11 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
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…
cs.CC2013
3-color Bounded Patterned Self-assembly
Lila Kari, Steffen Kopecki, Shinnosuke Seki
Patterned self-assembly tile set synthesis PATS is the problem of finding a minimal tile set which uniquely self-assembles into a given pattern. Czeizler and Popa proved the NP-com…