P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Computing with Membranes: Attacking NP-Complete Problems
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Solving NP-Complete Problems Using P Systems with Active Membranes
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
A fast P system for finding a balanced 2-partition
Soft Computing - A Fusion of Foundations, Methodologies and Applications
An approach to computational complexity in membrane computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
On the efficiency of p systems with active membranes and two polarizations
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Attacking the common algorithmic problem by recognizer p systems
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Membrane computing and complexity theory: A characterization of PSPACE
Journal of Computer and System Sciences
Membrane computing and brane calculi. Old, new, and future bridges
Theoretical Computer Science
On a Păun's Conjecture in Membrane Systems
IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
A Framework for Complexity Classes in Membrane Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity aspects of polarizationless membrane systems
Natural Computing: an international journal
Efficient computation in rational-valued p systems
Mathematical Structures in Computer Science
Uniform solution of QSAT using polarizationless active membranes
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Computational complexity of tissue-like P systems
Journal of Complexity
P systems with active membranes: trading time for space
Natural Computing: an international journal
P systems with active membranes characterize PSPACE
DNA'06 Proceedings of the 12th international conference on DNA Computing
A computational complexity theory in membrane computing
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Characterizing tractability by tissue-like p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Searching previous configurations in membrane computing
WMC'09 Proceedings of the 10th international conference on Membrane Computing
An efficient simulation of polynomial-space turing machines by p systems with active membranes
WMC'09 Proceedings of the 10th international conference on Membrane Computing
A Tissue P Systems Based Uniform Solution to Tripartite Matching Problem
Fundamenta Informaticae
Hi-index | 0.00 |
In this paper we study membrane dissolution rules in the framework of P systems with active membranes but without using electrical charges. More precisely, we prove that the polynomial computational complexity class associated with the class of recognizer P systems with active membranes, without polarizations and without dissolution coincides with the standard complexity class P. Furthermore, we demonstrate that if we consider dissolution rules, then the resulting complexity class contains the class NP.