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.Ministerio de Ciencia y Tecnología TIC2002-04220-C03-0
We are going to present a polynomially uniform solution to the Quanti ed 3SAT decision problem with...
We study a P˘aun’s conjecture concerning the unsolvability of NP–complete problems by polarizationl...
The aim of this paper is to study the computational power of P systems with one active membrane wit...
We study the computational efficiency of recognizer P systems with active membranes without polariz...
Trading (in polynomial time) space for time in the framework of membrane systems is not sufficient t...
Recognizer P systems with active membranes have proven to be very powerful computing devices, being...
We investigate polarizationless P systems with active membranes working in maximally parallel manne...
P systems with active membranes, in their classical definition, make use of noncooperative rules on...
In this paper we consider three restricted variants of P systems with active membranes: (1) P syste...
We identify a family of decision problems that are hard for some complexity classes defined in term...
Membrane systems with dividing and dissolving membranes are known to solve PSPACE problems in polyn...
From a computational complexity point of view, some syntactical ingredients play differentroles depe...
In living cells, new membranes are produced basically through two processes: mitosis and autopoiesis...
AbstractIn living cells, new membranes are produced basically through two processes: mitosis and aut...
Membrane systems with dividing and dissolving membranes are known to solve PSPACE problems in polyn...
We are going to present a polynomially uniform solution to the Quanti ed 3SAT decision problem with...
We study a P˘aun’s conjecture concerning the unsolvability of NP–complete problems by polarizationl...
The aim of this paper is to study the computational power of P systems with one active membrane wit...
We study the computational efficiency of recognizer P systems with active membranes without polariz...
Trading (in polynomial time) space for time in the framework of membrane systems is not sufficient t...
Recognizer P systems with active membranes have proven to be very powerful computing devices, being...
We investigate polarizationless P systems with active membranes working in maximally parallel manne...
P systems with active membranes, in their classical definition, make use of noncooperative rules on...
In this paper we consider three restricted variants of P systems with active membranes: (1) P syste...
We identify a family of decision problems that are hard for some complexity classes defined in term...
Membrane systems with dividing and dissolving membranes are known to solve PSPACE problems in polyn...
From a computational complexity point of view, some syntactical ingredients play differentroles depe...
In living cells, new membranes are produced basically through two processes: mitosis and autopoiesis...
AbstractIn living cells, new membranes are produced basically through two processes: mitosis and aut...
Membrane systems with dividing and dissolving membranes are known to solve PSPACE problems in polyn...
We are going to present a polynomially uniform solution to the Quanti ed 3SAT decision problem with...
We study a P˘aun’s conjecture concerning the unsolvability of NP–complete problems by polarizationl...
The aim of this paper is to study the computational power of P systems with one active membrane wit...