Small universal accepting hybrid networks of evolutionary processors (Q968278): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00236-009-0113-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1980972224
@@ Property / OpenAlex ID: W1980972224 / rank @@
+Normal rank
@@ Property / cites work @@
+About Universal Hybrid Networks of Evolutionary Processors of Small Size
+Normal rank
@@ Property / cites work @@
+On the size of computationally complete hybrid networks of evolutionary processors
+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 size complexity of universal accepting hybrid networks of evolutionary processors
+Normal rank
@@ Property / cites work @@
+All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
+Normal rank
@@ Property / cites work @@
+DNA Computing
@@ Property / cites work: DNA Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Q5586325
@@ Property / cites work: Q5586325 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Formal Reductions of the General Combinatorial Decision Problem
+Normal rank
@@ Property / cites work @@
+Small universal Turing machines
@@ Property / cites work: Small universal Turing machines / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank