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
Computing Homology Groups in Binary 2D Imagery by Tissue-like P Systems
(Romanian Academy, Section for Information Science and Technology, 2010)
We present a new solution for the Homology Groups of Binary 2D Image (HGB2I) Problem by using Membrane Computing techniques. This is a classical problem in Homology Theory which tries to calculate the number of connected ...
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
Efficient simulation of tissue-like P systems by transition cell-like P systems
(Springer, 2009)
In the framework of P systems, it is known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP-complete problems. Nonetheless, it could be sufficient to create ...
Artículo
Computational Efficiency of Cellular Division in Tissue-like Membrane Systems
(Romanian Academy, 2008)
Tissue-like P systems with cell division are computing models in the framework of membrane computing. They are inspired by the intercellular communication and neuronal synaptics, their structures being formalized ...