Complexities for generalized models of self-assembly

In this paper, we extend Rothemund and Winfree's examination of the tile complexity of tile self-assembly [6]. They provided a lower bound of ( log N log log N ) on the tile complexity of assembling an N

• Type: Conference
• Year: 2004
• Where: SODA
• Authors: Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang Kao, Robert T. Schweller
• Keywords: Algorithms, Lower Bound, SODA 2004, Tile, Tile Complexity