A study on complexity measure of diamond tile self-assembly system

DOI10.1007/978-981-13-0023-3_19MaRDI QIDQ5114870zbMATH OpenOpenAlexFDO

Authors M. Nithya Kalyani, P. Helen Chandra, S. M. Saroja T. Kalavathy

Publication date 29 June 2020

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-981-13-0023-3_19

zbMATH Keywords

self-assemblyprogram-size complexitydiamond tile assembly

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Recommendations

• The program-size complexity of self-assembled squares (extended abstract)
• DNA Computing
• Complexity of Self‐Assembled Shapes
• Complexities for generalized models of self-assembly
• Complexities for high-temperature two-handed tile self-assembly

Cites work

• Complexity of Self‐Assembled Shapes
• Computability and complexity in self-assembly
• On non-computable functions
• Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
• The program-size complexity of self-assembled squares (extended abstract)
• Undecidability and nonperiodicity for tilings of the plane

Cited in

(1)

• Cooperative assembly systems

This page was built for publication: A study on complexity measure of diamond tile self-assembly system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114870)