Mobile membranes: computability and complexity
From MaRDI portal
Recommendations
Cited in
(20)- New Computational Paradigms
- Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
- Enhanced mobile membranes: computability results
- Reversing computation in membrane systems
- Mutual mobile membranes with objects on surface
- On the Reachability Problem in P Systems with Mobile Membranes
- Computing by endocytosis and exocytosis
- Logical Approaches to Computational Barriers
- On the Computational Power of Flip-Flop Proteins on Membranes
- Complexity classes in models of cellular computing with membranes
- P systems with mobile membranes
- Describing the immune system using enhanced mobile membranes
- On the Computational Power of Enhanced Mobile Membranes
- A Membrane Algorithm for the Min Storage Problem
- Turing Completeness Using Three Mobile Membranes
- Simple, Enhanced and Mutual Mobile Membranes
- A \(\Sigma_2^{\mathrm P} \cup \Pi_2^{\mathrm P}\) lower bound using mobile membranes
- Selected Topics in Computational Complexity of Membrane Systems
- On the computability power of membrane systems with controlled mobility
- Computability power of mobility in enhanced mobile membranes
This page was built for publication: Mobile membranes: computability and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851900)
