Strict self-assembly of discrete Sierpinski triangles (Q1004083): Difference between revisions

@@ Property / cites work @@
+Combinatorial optimization problems in self-assembly
+Normal rank
@@ Property / cites work @@
+The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2005
@@ Property / cites work: Mathematical Foundations of Computer Science 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4431283
@@ Property / cites work: Q4431283 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4320535
@@ Property / cites work: Q4320535 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3856819
@@ Property / cites work: Q3856819 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737139
@@ Property / cites work: Q4737139 / rank @@
+Normal rank
@@ Property / cites work @@
+The program-size complexity of self-assembled squares (extended abstract)
+Normal rank
@@ Property / cites work @@
+Complexity of Self‐Assembled Shapes
@@ Property / cites work: Complexity of Self‐Assembled Shapes / rank @@
+Normal rank
@@ Property / cites work @@
+Q5509685
@@ Property / cites work: Q5509685 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3675527
@@ Property / cites work: Q3675527 / rank @@
+Normal rank