Buscar
Mostrando ítems 1-2 de 2
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
Reaching efficiency through collaboration in membrane systems: Dissolution, polarization and cooperation
(Elsevier, 2017)
From a computational complexity point of view, some syntactical ingredients play differentroles depending on the kind of combination considered. Inspired by the fact that the passing of a chemical substance through a ...