Buscar
Mostrando ítems 1-3 de 3
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 ...
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
The role of integral membrane proteins in computational complexity theory
(Springer, 2018)
In the framework of Membrane Computing, several tools to tackle the P versus NP problems by means of frontiers of the efficiency expressed in terms of syntactic or semantic ingredients, have been developed. In this paper, ...