3-color bounded patterned self-assembly
From MaRDI portal
Abstract: Patterned self-assembly tile set synthesis PATS is the problem of finding a minimal tile set which uniquely self-assembles into a given pattern. Czeizler and Popa proved the NP-completeness of PATS and Seki showed that the PATS problem is already NP-complete for patterns with 60 colors. In search for the minimal number of colors such that PATS remains NP-complete, we introduce multiple bound PATS (mbPATS) where we allow bounds for the numbers of tile types of each color. We show that mbPATS is NP-complete for patterns with just three colors and, as a byproduct of this result, we also obtain a novel proof for the NP-completeness of PATS which is more concise than the previous proofs.
Recommendations
- 3-color bounded patterned self-assembly (extended abstract)
- Computing minimum tile sets to self-assemble color patterns
- Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
- Combinatorial Optimization in Pattern Assembly
- Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
Cites work
- 3-color bounded patterned self-assembly (extended abstract)
- A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis
- Combinatorial Optimization in Pattern Assembly
- Computing minimum tile sets to self-assemble color patterns
- Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
- Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
- The program-size complexity of self-assembled squares (extended abstract)
Cited in
(2)
This page was built for publication: 3-color bounded patterned self-assembly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003474)
