3-color bounded patterned self-assembly
3-color bounded patterned self-assembly
复制标题
三色有界图案自组装
DOI:
10.1007/s11047-014-9434-9
复制
发表时间:
2015
影响因子:
2.1
通讯作者:
Shinnosuke Seki
中科院分区:
文献类型:
--
作者:
Lila Kari;Steffen Kopecki;Shinnosuke Seki
The problem ofpatterned self-assembly tile set synthesis(Pats) is to find a minimal tile set which uniquely self-assembles into a given pattern. Czeizler and Popa proved the-completeness ofPatsand Seki showed that thePatsproblem is already-complete for patterns with 60 colors. In search for the minimal number of colors such thatPatsremains-complete, we introduce multiple boundPats(mbPats) where we allow bounds for the numbers of tile types of each color. We show thatmbPatsis-complete for patterns with just three colors and, as a byproduct of this result, we also obtain a novel proof for the-completeness ofPatswhich is more concise than the previous proofs.
登录
查看更多内容
DOI:
10.1109/tcad.2008.917973
发表时间:
2008-05
影响因子:
2.9
作者:
Xiaojun Ma;F. Lombardi
通讯作者:
Xiaojun Ma;F. Lombardi
影响因子:
1
作者:
Johnsen, Aleck;Kao, Ming-Yang;Seki, Shinnosuke
通讯作者:
Seki, Shinnosuke
DOI:
10.1007/978-3-642-45030-3_65
发表时间:
2013
期刊:
--
影响因子:
--
作者:
Aleck C. Johnsen;M. Kao;Shinnosuke Seki
通讯作者:
Shinnosuke Seki
DOI:
--
发表时间:
2013
期刊:
International Conference on Unconventional Computation and Natural Computation
影响因子:
--
作者:
Shinnosuke Seki
通讯作者:
Shinnosuke Seki
DOI:
--
发表时间:
2004
期刊:
--
影响因子:
--
作者:
S. Sahni
通讯作者:
S. Sahni