3-color bounded patterned self-assembly (Q2003474)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	3-color bounded patterned self-assembly	scientific article

Statements

scholarly article

0 references

3-color bounded patterned self-assembly (English)

0 references

zbMATH Open document ID

0 references

10.1007/s11047-014-9434-9

0 references

0 references

Steffen Kopecki

0 references

Shinnosuke Seki

0 references

Natural Computing

0 references

publication date

8 July 2019

0 references

full work available at URL

https://arxiv.org/abs/1306.3257

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Synthesizing Minimal Tile Sets for Complex Patterns in the Framework of Patterned DNA Self-Assembly

0 references

Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly

0 references

A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis

0 references

Computing Minimum Tile Sets to Self-Assemble Color Patterns

0 references

Binary pattern tile set synthesis is NP-hard

0 references

3-Color Bounded Patterned Self-assembly

0 references

The program-size complexity of self-assembled squares (extended abstract)

0 references

Combinatorial Optimization in Pattern Assembly

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2003474

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2003474&oldid=36506963"