A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis (Q511695): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-015-9975-6
@@ Property / DOI: 10.1007/s10878-015-9975-6 / rank @@
-Normal rank
@@ Property / cites work @@
+Solving NP-complete problems in the tile assembly model
+Normal rank
@@ Property / cites work @@
+Solving satisfiability in the tile assembly model with a constant-size tileset
+Normal rank
@@ Property / cites work @@
+Efficient 3-SAT algorithms in the tile assembly model
+Normal rank
@@ Property / cites work @@
+DNA Computing
@@ Property / cites work: DNA Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4371018
@@ Property / cites work: Q4371018 / 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 @@
+Search methods for tile sets in patterned DNA self-assembly
+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 complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization in Pattern Assembly
@@ Property / cites work: Combinatorial Optimization in Pattern Assembly / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-015-9975-6
@@ Property / DOI: 10.1007/S10878-015-9975-6 / rank @@
+Normal rank