Buscar
Mostrando ítems 1-5 de 5
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
Counting Membrane Systems
(University of Bradford, Faculty of Engineering and Informatics, 2017)
A decision problem is one that has a yes/no answer, while a counting problem asks how many possible solutions exist associated with each instance. Every decision problem X has associated a counting problem, denoted by ...
Ponencia
Restricted Polarizationless P Systems with Active Membranes: Minimal Cooperation Only Inwards
(Fenix Editora, 2017)
Membrane computing is a computing paradigm providing a class of distributed parallel computing devices of a biochemical type whose process units represent biological membranes. In the cell-like basic model, a hierarchical ...
Ponencia
Restricted Polarizationless P Systems with Active Membranes: Minimal Cooperation Only Outwards
(Fenix Editora, 2017)
Membrane computing is a computing paradigm providing a class of distributed parallel computing devices of a biochemical type whose process units represent biological membranes. In the cell-like basic model, a hierarchical ...
Ponencia
An apparently innocent problem in Membrane Computing
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
The search for effcient solutions of computationally hard problems by means of families of membrane systems has lead to a wide and prosperous eld of research. The study of computational complexity theory in Membrane ...