Computational complexity of P systems with active membranes
From MaRDI portal
Publication:5404840
DOI10.1007/978-3-642-54239-8_3zbMATH Open1407.68173OpenAlexW53291507MaRDI QIDQ5404840FDOQ5404840
Authors: Alberto Leporati 
Publication date: 28 March 2014
Published in: Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54239-8_3
Recommendations
- Active membranes, proteins on membranes, tissue P systems: complexity-related issues and challenges
- Recent complexity-theoretic results on P systems with active membranes
- P Systems with Active Membranes Working in Sublinear Space
- A survey of membrane computing systems attacking hard computational problems
- P systems attacking hard problems beyond NP: a survey
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (11)
- Title not available (Why is that?)
- Time and space complexity of P systems -- and why they matter
- P systems attacking hard problems beyond NP: a survey
- A survey of membrane computing systems attacking hard computational problems
- Complexity classes for membrane systems: a survey
- P Systems with Elementary Active Membranes: Beyond NP and coNP
- Recent complexity-theoretic results on P systems with active membranes
- A \(\Sigma_2^{\mathrm P} \cup \Pi_2^{\mathrm P}\) lower bound using mobile membranes
- Selected Topics in Computational Complexity of Membrane Systems
- Active membranes, proteins on membranes, tissue P systems: complexity-related issues and challenges
- Title not available (Why is that?)
This page was built for publication: Computational complexity of P systems with active membranes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404840)
