Computability and complexity in self-assembly (Q537904): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict self-assembly of discrete Sierpinski triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The program-size complexity of self-assembled squares (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Self‐Assembled Shapes / rank
 
Normal rank

Latest revision as of 02:47, 4 July 2024

scientific article
Language Label Description Also known as
English
Computability and complexity in self-assembly
scientific article

    Statements

    Computability and complexity in self-assembly (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    computability
    0 references
    computational complexity
    0 references
    molecular computing
    0 references
    self-assembly
    0 references
    0 references