Time Optimal Self-assembling of 2 D and 3 D shapes : the Case of Squares and Cubes ∗
暂无分享,去创建一个
[1] Erik Winfree,et al. The program-size complexity of self-assembled squares (extended abstract) , 2000, STOC '00.
[2] M. Sahani,et al. Algorithmic Self-Assembly of DNA , 2006 .
[3] E. Winfree. Simulations of Computing by Self-Assembly , 1998 .
[4] Ashish Goel,et al. Running time and program size for self-assembled squares , 2001, STOC '01.
[5] Ivan Rapaport,et al. Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time , 2006, FSTTCS.
[6] Erik Winfree,et al. Complexity of Self-Assembled Shapes , 2004, SIAM J. Comput..
[7] Brian A. Davey,et al. An Introduction to Lattices and Order , 1989 .