Time Complexity of Computation and Construction in the Chemical Reaction Network-Controlled Tile Assembly Model

DOI10.1007/978-3-319-43994-5_11zbMath1451.68117OpenAlexW2510764078MaRDI QIDQ2835714

Nicholas Schiefer, Erik Winfree

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-43994-5_11

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (2)

Building squares with optimal state complexity in restricted active self-assembly ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• An introduction to tile-based self-assembly and a survey of recent results
• Reachability bounds for chemical reaction networks and strand displacement systems
• Modular verification of chemical reaction network encodings via serializability analysis
• Computation with finite stochastic chemical reaction networks
• Universal Computation and Optimal Construction in the Chemical Reaction Network-Controlled Tile Assembly Model
• Efficient Turing-Universal Computation with DNA Polymers
• Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems
• The program-size complexity of self-assembled squares (extended abstract)
• On the Computational Power of Biochemistry
• Two-domain DNA strand displacement
• Running time and program size for self-assembled squares
• Complexities for Generalized Models of Self-Assembly
• Complexity of Self‐Assembled Shapes

This page was built for publication: Time Complexity of Computation and Construction in the Chemical Reaction Network-Controlled Tile Assembly Model