Buscar
Mostrando ítems 31-40 de 50
Artículo
Tuning Frontiers of Efficiency in Tissue P Systems with Evolutional Communication Rules
(Hindawi, 2021)
Over the last few years, a new methodology to address the P versus NP problem has been developed, based on searching for borderlines between the nonefficiency of computing models (only problems in class P can be solved ...
Artículo
Membrane Fission: A Computational Complexity Perspective
(Wiley, 2016)
Membrane fission is a process by which a biological membrane is split into two new ones in the manner that the content of the initial membrane is separated and distributed between the new membranes. Inspired by this biological ...
Artículo
Dendrite P Systems Toolbox: Representation, Algorithms and Simulators
(World Scientific, 2021)
Dendrite P systems (DeP systems) are a recently introduced neural-like model of computation. They provide an alternative to the more classical spiking neural (SN) P systems. In this paper, we present the first software ...
Artículo
Membrane creation and symport/antiport rules solving QSAT
(Springer, 2022-09-12)
In Membrane Computing, diferent variants of devices can be found by changing both syntactical and semantic ingredients. These devices are usually called membrane systems or P systems, and they recall the structure and ...
Artículo
A new P-Lingua toolkit for agile development in membrane computing
(Elsevier, 2022)
Membrane computing is a massively parallel and non-deterministic bioinspired computing paradigm whose models are called P systems. Validating and testing such models is a challenge which is being overcome by developing ...
Artículo
Proof techniques in Membrane Computing
(Elsevier, 2021)
From the creation of the field of Membrane Computing in 1998, several research lines havebeen opened. On the one hand, theoretical questions like the computational power and thecomputational efficiency of P systems have ...
Artículo
Cooperative P Systems and the P Versus NP Problem
(IMCS: International Membrane Computing Society, 2017)
The P versus NP problem is undoubtedly the most important open question in computer science. Frontiers of tractability or efficiency expressed by means of syntactic or semantic ingredients in the framework of Membrane ...
Artículo
From SAT to SAT-UNSAT using P systems with dissolution rules
(Springer, 2022)
DP is the class of problems that are the differences between two languages from NP. Most difficult problems from DP are called DP-complete problems, that can be seen as the conjunction of an NP-complete problem and a ...
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, ...
Artículo
From NP-Completeness to DP-Completeness: A Membrane Computing Perspective
(Hindawi, 2020)
Presumably efficient computing models are characterized by their capability to provide polynomial-time solutions for NPcomplete problems. Given a classRof recognizer membrane systems,Rdenotes the set of decision problems ...