A carregar...
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...
Na minha lista:
| Main Authors: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
2012
|
| Assuntos: | |
| Acesso em linha: | 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: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|