All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size (Q2379954): Difference between revisions

@@ Property / cites work @@
+Aspects of Molecular Computing
@@ Property / cites work: Aspects of Molecular Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Hybrid networks of evolutionary processors are computationally complete
+Normal rank
@@ Property / cites work @@
+Introduction to evolutionary computing
@@ Property / cites work: Introduction to evolutionary computing / rank @@
+Normal rank
@@ Property / cites work @@
+Accepting networks of splicing processors: complexity results
+Normal rank
@@ Property / cites work @@
+Machines, Computations, and Universality
@@ Property / cites work: Machines, Computations, and Universality / rank @@
+Normal rank
@@ Property / cites work @@
+On the size complexity of universal accepting hybrid networks of evolutionary processors
+Normal rank
@@ Property / cites work @@
+DNA Computing
@@ Property / cites work: DNA Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank