Computability and complexity in self-assembly (Q537904): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00224-010-9252-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2013397449
@@ Property / OpenAlex ID: W2013397449 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Algorithms
@@ Property / cites work: On the Computational Complexity of Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?
+Normal rank
@@ Property / cites work @@
+Strict self-assembly of discrete Sierpinski triangles
+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