Buscar
Mostrando ítems 1-9 de 9
Ponencia
On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution
(Fénix Editora, 2008)
Recognizer P systems with active membranes have proven to be very powerful computing devices, being able to solve NP-complete decision problems in a polynomial time. However such solutions usually exploit many powerful ...
Ponencia
Introducing a Space Complexity Measure for P Systems
(Fénix Editora, 2009)
We define space complexity classes in the framework of membrane computing, giving some initial results about their mutual relations and their connection with time complexity classes, and identifying some potentially ...
Ponencia
Deterministic Solutions to QSAT and Q3SAT by Spiking Neural P Systems with Pre-Computed Resources
(Fénix Editora, 2009)
In this paper we continue previous studies on the computational effciency of spiking neural P systems, under the assumption that some pre-computed resources of exponential size are given in advance. Specifically, we give ...
Ponencia
Performing Arithmetic Operations with Spiking Neural P Systems
(Fénix Editora, 2009)
We consider spiking neural P systems as devices which can be used to perform some basic arithmetic operations, namely addition, subtraction, comparison and multiplication by a fixed factor. The input to these systems are ...
Ponencia
Simulating the Fredkin Gate with Energy-Based P Systems
(Fénix Editora, 2004)
Reversibility plays a fundamental role when the possibility to per- form computations with minimal energy dissipation is considered. Many pa- pers on reversible computation have appeared in literature: the most famous are ...
Ponencia
On the Computational Power of Spiking Neural P Systems
(Fénix Editora, 2007)
In this paper we study some computational properties of spiking neural P systems. In particular, we show that by using nondeterminism in a slightly extended version of spiking neural P systems it is possible to solve in ...
Ponencia
Solving Numerical NP-complete Problems by Spiking Neural P Systems with Pre–computed Resources
(Fénix Editora, 2008)
Recently we have considered the possibility of using spiking neural P systems for solving computationally hard problems, under the assumption that some (possibly exponentially large) pre-computed resources are given in ...
Ponencia
Three Quantum Algorithms to Solve 3-SAT
(Fénix Editora, 2006)
We propose three quantum algorithms to solve the 3-SAT NP-complete decision problem. The first algorithm builds, for any instance Á of 3-SAT, a quantum Fredkin circuit that computes a superposition of all classical ...
Ponencia
Sequential P Systems with Unit Rules and Energy Assigned to Membranes
(Fénix Editora, 2004)
We introduce a new variant of membrane systems where the rules are directly assigned to membranes (and not to the regions as this is usually observed in the area of membrane systems) and, moreover, every membrane carries ...