Journal of Computer and System Sciences
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Complexity classes in models of cellular computing with membranes
Natural Computing: an international journal
A P-Lingua Programming Environment for Membrane Computing
Membrane Computing
Solving the Independent Set Problem by Using Tissue-Like P Systems with Cell Division
IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
Computational complexity of tissue-like P systems
Journal of Complexity
Polynomial complexity classes in spiking neural P systems
CMC'10 Proceedings of the 11th international conference on Membrane computing
P systems with active membranes: trading time for space
Natural Computing: an international journal
A computational complexity theory in membrane computing
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Implementing p systems parallelism by means of GPUs
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
Tissue p systems with cell separation: upper bound by PSPACE
TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
The efficiency of tissue p systems with cell separation relies on the environment
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Limits of the power of tissue p systems with cell division
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 0.00 |
In this paper we introduce the complexity class PMCF of all decision problems solvable in polynomial time by a family of P systems belonging to a given class of membrane systems with input, F. We show that the problem of determining if a boolean formula in conjunctive normal form is satisfiable belongs to PMCAM, where AM is the class of recognizer P systems with input and with active membranes using 2-division. We conclude that the class NP is contained in the above mentioned complexity class.