Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems (Q766179): 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/s00236-011-0144-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2116584032
@@ Property / OpenAlex ID: W2116584032 / rank @@
+Normal rank
@@ Property / cites work @@
+Turing Completeness Using Three Mobile Membranes
@@ Property / cites work: Turing Completeness Using Three Mobile Membranes / rank @@
+Normal rank
@@ Property / cites work @@
+Simple, Enhanced and Mutual Mobile Membranes
@@ Property / cites work: Simple, Enhanced and Mutual Mobile Membranes / rank @@
+Normal rank
@@ Property / cites work @@
+Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
+Normal rank
@@ Property / cites work @@
+Enhanced mobile membranes: computability results
@@ Property / cites work: Enhanced mobile membranes: computability results / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A $\Sigma_2^P \cup \Pi_2^P$ Lower Bound Using Mobile Membranes
+Normal rank
@@ Property / cites work @@
+P systems with mobile membranes
@@ Property / cites work: P systems with mobile membranes / rank @@
+Normal rank
@@ Property / cites work @@
+Solving HPP and SAT by P systems with active membranes and separation rules
+Normal rank
@@ Property / cites work @@
+Q3406469
@@ Property / cites work: Q3406469 / rank @@
+Normal rank