Mobile membranes: computability and complexity
From MaRDI portal
Publication:2851900
DOI10.1007/978-3-642-39718-9_4zbMATH Open1405.68115OpenAlexW107702049MaRDI QIDQ2851900FDOQ2851900
Authors: Bogdan Aman, Gabriel Ciobanu 
Publication date: 4 October 2013
Published in: Theoretical Aspects of Computing – ICTAC 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39718-9_4
Recommendations
Cited In (17)
- 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
- On the Reachability Problem in P Systems with Mobile Membranes
- Mutual mobile membranes with objects on surface
- 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
- 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
- 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)
