Buscar
Mostrando ítems 1-7 de 7
Ponencia
Simulation of Computing P Systems: A GPU Design for the Factorization Problem
(Friedrich-Schiller-Universität Jena, 2018)
Artículo
The Unique Satisfiability Problem from a Membrane Computing Perspective
(Romanian Academy, Section for Information Science and Technology, 2018)
Complexity class DP is the class of “differences” of any two languages in NP. It verifies that NP[ co-NP DP PNP, where PNP is the second level of the polynomial hierarchy, specifically, it is the class of languages ...
Ponencia
Narrowing Frontiers of Efficiency with Evolutional Communication Rules and Cell Separation
(Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
In the framework of Membrane Computing, several efficient solutions to computationally hard problems have been given. To find new borderlines between families of P systems that can solve them and the ones that cannot is ...
Artículo
P systems with symport/antiport rules: When do the surroundings matter?
(Elsevier, 2018-05-01)
Cell-like P systems where communication between the regions are carried out by rules of type symport/antiport are considered. These systems compute by changing the places of objects with respect to the membranes, and not ...
Artículo
When object production tunes the efficiency of membrane systems
(Elsevier, 2020)
Psystems with active membranes is one of the most studied models within the field ofMembrane Computing. Simulating the organization and behavior of the living cells througha tree-like structure and abstracting the mechanisms ...
Ponencia
Limits on P Systems with Proteins and Without Division
(Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
In the field of Membrane Computing, computational complexity theory has been widely studied trying to nd frontiers of efficiency by means of syntactic or semantical ingredients. The objective of this is to nd two kinds ...
Ponencia
The Factorization Problem: A New Approach Through Membrane Systems
(University of Paris Est Creteil Val de Marne, 2018)
The factorization problem (given a natural number which is the product of two prime numbers, find its decomposition) is conjectured to be intractable and for that it has been used as the key to have secure current ...