11色图案自组装瓦组合成的NP难性的手工检验证明
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tile set synthesis
摘要:
图案化自组装瓦片集合成(Patterned self-assembly tile set synthesis,PATS)的目标是找到一个最小瓦片集来唯一地自组装给定的矩形(颜色)图案。对于k >= 1,k-PATS是PATS的变体,其将输入图案限制为至多具有$k$颜色的那些图案。Kari等人最近提出了2-PATS的计算机辅助证明。[arXiv:1404.0967(2014)]。相比之下,最著名的可手动检查的证明是由Johnsen、Kao和Seki针对29-PATS的NP硬度[ISAAC 2013,LNCS 8283,pp.~ 699-710]。我们提出了一个手动检查证明的NP-硬度的11-PATS。
英文摘要:
Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely self-assemble a given rectangular (color) pattern. For k >= 1, k-PATS is a variant of PATS that restricts input patterns to those with at most $k$ colors. A computer-assisted proof has been recently proposed for 2-PATS by Kari et al. [arXiv:1404.0967 (2014)]. In contrast, the best known manually-checkable proof is for the NP-hardness of 29-PATS by Johnsen, Kao, and Seki [ISAAC 2013, LNCS 8283, pp.~699-710]. We propose a manually-checkable proof for the NP-hardness of 11-PATS.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。