Journal of Computer and System Sciences
Membrane Computing: An Introduction
Membrane Computing: An Introduction
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
Complexity aspects of polarizationless membrane systems
Natural Computing: an international journal
Uniform solution of QSAT using polarizationless active membranes
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
A logarithmic bound for solving subset sum with P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
On the power of dissolution in p systems with active membranes
WMC'05 Proceedings of the 6th international conference on Membrane Computing
A computational complexity theory in membrane computing
WMC'09 Proceedings of the 10th international conference on Membrane Computing
| Hi-index | 0.00 |
Many NP-complete problems can be viewed as special cases of the Common Algorithmic Problem (CAP). In a precise sense, which will be defined in the paper, one may say that CAP has a property of local universality. In this paper we present an effective solution to the decision version of the CAP using a family of recognizer P systems with active membranes. The analysis of the solution presented here will be done from the point of view of complexity classes in P systems.