Toward minimum size self-assembled counters

DOI10.1007/S11047-008-9070-3zbMath1154.68417OpenAlexW1996617718MaRDI QIDQ941685

Ashish Goel, Pablo Moisset de Espanés

Publication date: 2 September 2008

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-008-9070-3

zbMATH Keywords

ComplexityNanotechnologyAlgorithmic self-assemblyExhaustive searchCounters

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Pattern recognition, speech recognition (68T10)

Related Items (1)

Connecting the Dots: Molecular Machinery for Distributed Robotics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The program-size complexity of self-assembled squares (extended abstract)
• Combinatorial optimization problems in self-assembly
• Reducing tile complexity for self-assembly through temperature programming
• Running time and program size for self-assembled squares
• Toward Minimum Size Self-Assembled Counters
• DNA Computing
• DNA Computing

This page was built for publication: Toward minimum size self-assembled counters