Buscar
Mostrando ítems 21-25 de 25
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
Characterizing the Computational Power of Energy-Based P Systems
(Fénix Editora, 2012)
We investigate the computational power of energy-based P systems, a model of membrane systems where a fixed amount of energy is associated with each object and the rules transform single objects by adding or removing ...
Ponencia
Constant-Space P Systems with Active Membranes
(Fénix Editora, 2014)
We continue the investigation of the computational power of space- constrained P systems. We show that only a constant amount of space is needed in order to simulate a polynomial-space bounded Turing machine. Due to this ...
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 ...
Ponencia
Elementary Active Membranes Have the Power of Counting
(Fénix Editora, 2011)
We prove that uniform families of P systems with active membranes operat- ing in polynomial time can solve the whole class of PP decision problems, without using nonelementary membrane division or dissolution rules. This ...