The program-size complexity of self-assembled squares (extended abstract)

Article The program-size complexity of self-assembled squares (extended abstract) Share on Authors: Paul W. K. Rothemund Dept. of Computer Science, University of Southern California Dept. of Computer Science, University of Southern CaliforniaView Profile , Erik Winfree Dept. of Computer Science and CNS, California Institute of Technology Dept. of Computer Science and CNS, California Institute of TechnologyView Profile Authors Info & Claims STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computingMay 2000 Pages 459–468https://doi.org/10.1145/335305.335358Online:01 May 2000Publication History 251citation994DownloadsMetricsTotal Citations251Total Downloads994Last 12 Months30Last 6 weeks8 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access