Complexity aspects of polarizationless membrane systems
From MaRDI portal
Publication:2655492
DOI10.1007/s11047-008-9100-1zbMath1185.68339OpenAlexW1983699834WikidataQ57518536 ScholiaQ57518536MaRDI QIDQ2655492
Claudio Zandron, Alberto Leporati, Mario J. Pérez-Jiménez, Claudio Ferretti, Giancarlo Mauri
Publication date: 25 January 2010
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle/11441/68042
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
On the power of P systems with active membranes using weak non-elementary membrane division, Evaluating space measures in P systems, Bounding the space in P systems with active membranes, Alternative space definitions for P systems with active membranes, A new method to simulate restricted variants of polarizationless P systems with active membranes, Selected Topics in Computational Complexity of Membrane Systems, A $\Sigma_2^P \cup \Pi_2^P$ Lower Bound Using Mobile Membranes, Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems, P systems attacking hard problems beyond NP: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- P systems with minimal parallelism
- The computational power of cell division in P systems: Beating down parallel computers?
- A fast \(P\) system for finding a balanced 2-partition
- Membrane Computing
- Machines, Computations, and Universality
- Membrane Computing
- Aspects of Molecular Computing
- Membrane Computing
