Bounding the space in P systems with active membranes
From MaRDI portal
Publication:1982967
DOI10.1007/s41965-020-00039-xzbMath1469.68059OpenAlexW3020733756MaRDI QIDQ1982967
Publication date: 14 September 2021
Published in: Journal of Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41965-020-00039-x
Analysis of algorithms and problem complexity (68Q25) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items (8)
On the power of P systems with active membranes using weak non-elementary membrane division ⋮ Evaluating space measures in P systems ⋮ Description of membrane systems with time Petri nets: promoters/inhibitors, membrane dissolution, and priorities ⋮ Alternative space definitions for P systems with active membranes ⋮ Proof techniques in membrane computing ⋮ Spiking neural P systems with target indications ⋮ Rule synchronization for tissue P systems ⋮ Time-free Solution to Independent Set Problem using P Systems with Active Membranes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A toolbox for simpler active membrane algorithms
- P systems with active membranes: Trading time for space
- The computational power of membrane systems under tight uniformity conditions
- Trading polarizations for labels in P systems with active membranes
- Non-confluence in divisionless P systems with active membranes
- Membrane computing and complexity theory: A characterization of PSPACE
- The computational power of cell division in P systems: Beating down parallel computers?
- Reaching efficiency through collaboration in membrane systems: dissolution, polarization and cooperation
- A Turing machine simulation by P systems without charges
- Shallow laconic P-systems can count
- A new method to simulate restricted variants of polarizationless P systems with active membranes
- Characterizing PSPACE with shallow non-confluent P systems
- Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems
- P systems attacking hard problems beyond NP: a survey
- Monodirectional P systems
- Solving QSAT in sublinear depth
- Characterising the complexity of tissue P systems with fission rules
- Space complexity equivalence of P systems with active membranes and Turing machines
- Solving the subset-problem by P systems with active membrans
- On uniformity within \(NC^ 1\)
- Complexity aspects of polarizationless membrane systems
- Membrane Division, Oracles, and the Counting Hierarchy
- P Systems Simulating Oracle Computations
- Shallow Non-confluent P Systems
- P Systems with Elementary Active Membranes: Beyond NP and coNP
- PSYSTEMS WITH ACTIVE MEMBRANES WORKING IN POLYNOMIAL SPACE
- Complexity classes for membrane systems
- Simulating Elementary Active Membranes
- Computational Efficiency of Minimal Cooperation and Distribution in Polarizationless P Systems with Active Membranes
- Sublinear-Space P Systems with Active Membranes
- Constant-Space P Systems with Active Membranes
- Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P
- Theoretical Aspects of Computing - ICTAC 2004
- A Computational Complexity Theory in Membrane Computing
- On the Power of Computing with Proteins on Membranes
- Membrane Computing
- Membrane Computing
This page was built for publication: Bounding the space in P systems with active membranes
