A Logarithmic Bound for Solving Subset Sum with P Systems (Q5452061): 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/978-3-540-77312-2_16
+Normal rank
@@ Property / OpenAlex ID @@
+W1595596514
@@ Property / OpenAlex ID: W1595596514 / rank @@
+Normal rank
@@ Property / cites work @@
+Machines, Computations, and Universality
@@ Property / cites work: Machines, Computations, and Universality / rank @@
+Normal rank
@@ Property / cites work @@
+A Logarithmic Bound for Solving Subset Sum with P Systems
+Normal rank
@@ Property / cites work @@
+Computational efficiency of dissolution rules in membrane systems
+Normal rank
@@ Property / cites work @@
+A fast \(P\) system for finding a balanced 2-partition
+Normal rank
@@ Property / cites work @@
+Q2707525
@@ Property / cites work: Q2707525 / rank @@
+Normal rank
@@ Property / cites work @@
+Membrane computing. An introduction.
@@ Property / cites work: Membrane computing. An introduction. / rank @@
+Normal rank
@@ Property / cites work @@
+Membrane Computing
@@ Property / cites work: Membrane Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Machines, Computations, and Universality
@@ Property / cites work: Machines, Computations, and Universality / rank @@
+Normal rank
@@ Property / cites work @@
+Q3515202
@@ Property / cites work: Q3515202 / rank @@
+Normal rank