A uniform solution to SAT using membrane creation

Authors:
Miguel A. Gutiérrez-Naranjo;Mario J. Pérez-Jiménez;Francisco J. Romero-Campero
Affiliations:
Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s/n, 41012, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s/n, 41012, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s/n, 41012, Sevilla, Spain
Venue:
Theoretical Computer Science
Year:
2007

Citing 6
Cited 3

Computing with membranes

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport

New Generation Computing
A fast P system for finding a balanced 2-partition

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Characterizing Tractability with Membrane Creation

SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Towards a Programming Language in Cellular Computing

Electronic Notes in Theoretical Computer Science (ENTCS)

Letters: A variant of P systems for optimization

Neurocomputing
A Uniform Solution to HPP in Terms of Membrane Computing

AICI '09 Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence
On efficient algorithms for SAT

CMC'12 Proceedings of the 13th international conference on Membrane Computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

In living cells, new membranes are produced basically through two processes: mitosis and autopoiesis. These two processes have inspired two variants of cell-like membrane systems, namely P systems with active membranes and P systems with membrane creation. In this paper, we provide the first uniform, efficient solution to the SAT problem in the framework of recogniser P systems with membrane creation using dissolution rules. Recently the authors have proved that if the dissolution rules are not allowed to be used, then the polynomial complexity class associated with this variant of P systems is the standard complexity class P. This result, together with the main result of this paper, shows the surprising role of the apparently ''innocent'' operation of membrane dissolution. The use of this type of rule establishes the difference between efficiency and non-efficiency for P systems with membrane creation, and provides a barrier between P and NP (assuming PNP).