Rothemund, Paul W. K.; Winfree, Erik The program-size complexity of self-assembled squares (extended abstract). (English) Zbl 1296.68051 Proceedings of the thirty-second annual ACM symposium on theory of computing (STOC 2000), Portland, Oregon, USA, May 21–23, 2000. New York, NY: ACM Press (ISBN 1-58113-184-4). 459-468 (2000). Cited in 3 ReviewsCited in 104 Documents MSC: 68Q05 Models of computation (Turing machines, etc.) (MSC2010) 68Q25 Analysis of algorithms and problem complexity 92C40 Biochemistry, molecular biology PDF BibTeX XML Cite \textit{P. W. K. Rothemund} and \textit{E. Winfree}, in: Proceedings of the thirty-second annual ACM symposium on theory of computing, STOC 2000. Portland, Oregon, USA, May 21--23, 2000. New York, NY: ACM Press. 459--468 (2000; Zbl 1296.68051) Full Text: DOI