3-color bounded patterned self-assembly (Q2003474): Difference between revisions

@@ Property / arXiv ID @@
+.3257
@@ Property / arXiv ID: 1306.3257 / rank @@
+Normal rank
@@ Property / cites work @@
+Synthesizing Minimal Tile Sets for Complex Patterns in the Framework of Patterned DNA Self-Assembly
+Normal rank
@@ Property / cites work @@
+Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
+Normal rank
@@ Property / cites work @@
+A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis
+Normal rank
@@ Property / cites work @@
+Computing Minimum Tile Sets to Self-Assemble Color Patterns
+Normal rank
@@ Property / cites work @@
+Binary pattern tile set synthesis is NP-hard
@@ Property / cites work: Binary pattern tile set synthesis is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+-Color Bounded Patterned Self-assembly
@@ Property / cites work: 3-Color Bounded Patterned Self-assembly / rank @@
+Normal rank
@@ Property / cites work @@
+The program-size complexity of self-assembled squares (extended abstract)
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization in Pattern Assembly
@@ Property / cites work: Combinatorial Optimization in Pattern Assembly / rank @@
+Normal rank