Buscar
Mostrando ítems 1-5 de 5
Artículo
A uniform family of tissue P systems with cell division solving 3-COL in a linear time
(Elsevier, 2008)
Several examples of the efficiency of cell-like P systems regarding the solution of NPcomplete problems in polynomial time can be found in the literature(obviously, trading space for time). Recently, different new models ...
Artículo
A linear-time tissue P system based solution for the 3-coloring problem
(Elsevier, 2007)
In the literature, several examples of the efficiency of cell-like P systems regarding the solution of NPcomplete problems in polynomial time can be found (obviously, trading space for time). Recently, different new ...
Artículo
Solving Common Algorithmic Problem by Recognizer Tissue P Systems
(Romanian Academy, 2012)
Common Algorithmic Problem is an optimization problem, which has the nice property that several other NP-complete problems can be reduced to it in linear time. In this work, we deal with its decision version in the ...
Artículo
A Tissue P Systems Based Uniform Solution to Tripartite Matching Problem
(IOS Press, 2011)
A tissue P system with cell division is a computing model which has two basic features: intercellular communication and the ability of cell division. The ability of cell division allows us to obtain an exponential amount ...
Artículo
A polynomial alternative to unbounded environment for tissue P systems with cell division
(Taylor and Francis, 2013)
The standard definition of tissue P systems includes a special alphabet whose elements are assumed to appear in the initial configuration of the system in an arbitrarily large number of copies. These objects reside in ...