Binary Pattern Tile Set Synthesis Is NP-hard

We solve an open problem, stated in 2008, about the feasibility of designing efficient algorithmic self-assembling systems which produce 2-dimensional colored patterns. More precisely, we show that the problem of finding the smallest tile assembly system which will self-assemble an input pattern with 2 colors (i.e., \(2\)-Pats) is NP-hard. One crucial lemma makes use of a computer-assisted proof, which is a relatively novel but increasingly utilized paradigm for deriving proofs for complex mathematical problems. This tool is especially powerful for attacking combinatorial problems, as exemplified by the proof for the four color theorem and the recent important advance on the Erdős discrepancy problem using computer programs. In this paper, these techniques will be brought to a new order of magnitude, computational tasks corresponding to one CPU-year. We massively parallelize our program, and provide a full proof of its correctness. Its source code is freely available online.

[1]  Hao Wang.  Proving theorems by pattern recognition — II , 1961 .

[2]  Timothy Y. Chow.  Almost-natural proofs , 2011, J. Comput. Syst. Sci..

[3]  Ming-Yang Kao,et al.  Computing Minimum Tile Sets to Self-Assemble Color Patterns , 2013, ISAAC.

[4]  A. Turberfield,et al.  A DNA-fuelled molecular machine made of DNA , 2022 .

[5]  Alexander A. Razborov,et al.  Natural Proofs , 2007 .

[6]  P. Seymour,et al.  A new proof of the four-colour theorem , 1996 .

[7]  J. Reif,et al.  DNA-Templated Self-Assembly of Protein Arrays and Highly Conductive Nanowires , 2003, Science.

[8]  Ming-Yang Kao,et al.  A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis , 2017, J. Comb. Optim..

[9]  N. Seeman.  Nucleic acid junctions and lattices. , 1982, Journal of theoretical biology.

[10]  G. Seelig,et al.  Enzyme-Free Nucleic Acid Logic Circuits , 2022 .

[11]  Pekka Orponen,et al.  Search Methods for Tile Sets in Patterned DNA Self-Assembly , 2014, J. Comput. Syst. Sci..

[12]  E. Winfree,et al.  Algorithmic Self-Assembly of DNA Sierpinski Triangles , 2004, PLoS biology.

[13]  Lulu Qian,et al.  Supporting Online Material Materials and Methods Figs. S1 to S6 Tables S1 to S4 References and Notes Scaling up Digital Circuit Computation with Dna Strand Displacement Cascades , 2022 .

[14]  Günter Rote,et al.  Minimum-weight triangulation is NP-hard , 2006, JACM.

[15]  Erik Winfree,et al.  Molecular robots guided by prescriptive landscapes , 2010, Nature.

[16]  Shinnosuke Seki.  Combinatorial Optimization in Pattern Assembly - (Extended Abstract) , 2013, UCNC.

[17]  Lila Kari,et al.  3-Color Bounded Patterned Self-assembly - (Extended Abstract) , 2013, DNA.

[18]  K. Appel,et al.  Every planar map is four colorable. Part I: Discharging , 1977 .

[19]  Georges Gonthier,et al.  Formal Proof—The Four- Color Theorem , 2008 .

[20]  H. Helfgott.  The ternary Goldbach conjecture is true , 2013, 1312.7748.

[21]  K. Appel,et al.  Every planar map is four colorable. Part II: Reducibility , 1977 .

[22]  Eric Allender,et al.  Amplifying Lower Bounds by Means of Self-Reducibility , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[23]  Alexandru Popa,et al.  Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly , 2013, Theor. Comput. Sci..

[24]  M. Sahani,et al.  Algorithmic Self-Assembly of DNA , 2006 .

[25]  Xiaojun Ma,et al.  Synthesis of Tile Sets for DNA Self-Assembly , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[26]  Alexei Lisitsa,et al.  A SAT Attack on the Erdős Discrepancy Conjecture , 2014, SAT.

[27]  B Tuckerman.  The 24th mersenne prime. , 1971, Proceedings of the National Academy of Sciences of the United States of America.

[28]  Hao Yan,et al.  Periodic square-like gold nanoparticle arrays templated by self-assembled 2D DNA Nanogrids on a surface. , 2006, Nano letters.

[29]  Matthew Cook,et al.  Self-Assembled Circuit Patterns , 2003, DNA.

[30]  Erik Winfree,et al.  Two computational primitives for algorithmic self-assembly: copying and counting. , 2005, Nano letters.