Computability and complexity in self-assembly
type: Item
instance of: scholarly article
title: Computability and complexity in self-assembly
zbMATH Open document ID: 1217.68095
author: James I. Lathrop
author: Jack H. Lutz
author: Matthew J. Patitz
author: Scott M. Summers
published in: Theory of Computing Systems
publication date: 2011-05-23T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 52C20
zbMATH DE Number: 5898927
zbMATH Keywords: computability
zbMATH Keywords: computational complexity
zbMATH Keywords: molecular computing
zbMATH Keywords: self-assembly
MaRDI profile type: Publication
full work available at URL: s00224-010-9252-0
OpenAlex ID: W2013397449
cites work: On the Computational Complexity of Algorithms
cites work: On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?
cites work: Strict self-assembly of discrete Sierpinski triangles
cites work: Q4737139
cites work: The program-size complexity of self-assembled squares (extended abstract)
cites work: Complexity of Self‐Assembled Shapes
DOI: 10.1007/S00224-010-9252-0
description: scientific article; zbMATH DE number 5898927