Chargement en cours...
Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models
Efficient tile sets for self assembling rectilinear shapes is of critical importance in algorithmic self assembly. A lower bound on the tile complexity of any deterministic self assembly system for an n × n square is [Formula: see text] (inferred from the Kolmogrov complexity). Deterministic self as...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
2012
|
| Sujets: | |
| Accès en ligne: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3848893/ https://ncbi.nlm.nih.gov/pubmed/24311993 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s11047-012-9313-1 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|