A Study on Complexity Measure of Diamond Tile Self-assembly System

DOI10.1007/978-981-13-0023-3_19zbMATH Open1455.68058OpenAlexW2797721597MaRDI QIDQ5114870FDOQ5114870

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)

Cites Work

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

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)