On the power of membrane dissolution in polarizationless P systems with active membranes
From MaRDI portal
Publication:6136468
DOI10.1007/s11047-022-09926-xzbMath1530.68092OpenAlexW4311689235MaRDI QIDQ6136468
Publication date: 31 August 2023
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-022-09926-x
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Membrane computing and complexity theory: A characterization of PSPACE
- Space-bounded reducibility among combinatorial problems
- The computational power of cell division in P systems: Beating down parallel computers?
- Solving a special case of the P conjecture using dependency graphs with dissolution
- Seeking computational efficiency boundaries: the Păun's conjecture
- A new method to simulate restricted variants of polarizationless P systems with active membranes
- On the power of P systems with active membranes using weak non-elementary membrane division
- P systems attacking hard problems beyond NP: a survey
- Membrane Dissolution and Division in P
- Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques
- Simulating Elementary Active Membranes
- A Characterisation of NL Using Membrane Systems without Charges and Dissolution
- Uniform Solution of QSAT Using Polarizationless Active Membranes
- Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems
- Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P
- Membrane Computing
This page was built for publication: On the power of membrane dissolution in polarizationless P systems with active membranes
