In this chapter we present a general framework to provide efficient solutions to decision problems through families of cell-like membrane systems constructed in a semi-uniform way (associating with each instance of the problem one P system solving it) or a uniform way (all instances of a decision problem having the same size are processed by the same system). We also show a brief compendium of efficient semi-uniform and uniform solutions to hard problems in these systems, and we explicitly describe some of these solutions.Ministerio de Ciencia y Tecnología TIC2002-04220-C03-0
In this paper, a computational complexity theory within the framework of Membrane Computing is intr...
A P system is a novel computing model introduced by Paun in the area of membrane computing. It is kn...
In Membrane Computing, the solution of a decision problem X belonging to the complexity class P via...
We characterise the computational complexity of biological systems to assess their utility as novel ...
Many NP-complete problems can be viewed as special cases of the Common Algorithmic Problem (CAP). I...
We characterise the computational complexity of biological systems to assess their utility as novel ...
We apply techniques from complexity theory to a model of biological cellular membranes known as memb...
We summarise some current results for active membrane systems using uniformity below P. Many of the...
We identify a family of decision problems that are hard for some complexity classes defined in term...
In this paper we introduce the complexity class PMC∗ F of all decision problems solvable in polyno...
We are going to present a polynomially uniform solution to the Quanti ed 3SAT decision problem with...
Many variants of P systems have the ability to generate an exponential number of membranes in linea...
The search for effcient solutions of computationally hard problems by means of families of membrane...
A single Turing machine can solve decision problems with an in nite number of instances. On the oth...
In this work we revisit the basic concepts, definitions of computational complexity theory in membr...
In this paper, a computational complexity theory within the framework of Membrane Computing is intr...
A P system is a novel computing model introduced by Paun in the area of membrane computing. It is kn...
In Membrane Computing, the solution of a decision problem X belonging to the complexity class P via...
We characterise the computational complexity of biological systems to assess their utility as novel ...
Many NP-complete problems can be viewed as special cases of the Common Algorithmic Problem (CAP). I...
We characterise the computational complexity of biological systems to assess their utility as novel ...
We apply techniques from complexity theory to a model of biological cellular membranes known as memb...
We summarise some current results for active membrane systems using uniformity below P. Many of the...
We identify a family of decision problems that are hard for some complexity classes defined in term...
In this paper we introduce the complexity class PMC∗ F of all decision problems solvable in polyno...
We are going to present a polynomially uniform solution to the Quanti ed 3SAT decision problem with...
Many variants of P systems have the ability to generate an exponential number of membranes in linea...
The search for effcient solutions of computationally hard problems by means of families of membrane...
A single Turing machine can solve decision problems with an in nite number of instances. On the oth...
In this work we revisit the basic concepts, definitions of computational complexity theory in membr...
In this paper, a computational complexity theory within the framework of Membrane Computing is intr...
A P system is a novel computing model introduced by Paun in the area of membrane computing. It is kn...
In Membrane Computing, the solution of a decision problem X belonging to the complexity class P via...