Rule set design problems for oritatami systems (Q529023): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2016.09.010
@@ Property / DOI: 10.1016/j.tcs.2016.09.010 / rank @@
-Normal rank
@@ Property / cites work @@
+Control of Boolean networks: hardness results and algorithms for tree structured networks
+Normal rank
@@ Property / cites work @@
+Programming Biomolecules That Fold Greedily During Transcription
+Normal rank
@@ Property / cites work @@
+Nondeterministic Seedless Oritatami Systems and Hardness of Testing Their Equivalence
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+P-completeness of Cellular Automaton Rule 110
@@ Property / cites work: P-completeness of Cellular Automaton Rule 110 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2016.09.010
@@ Property / DOI: 10.1016/J.TCS.2016.09.010 / rank @@
+Normal rank