Buscar
Mostrando ítems 1-4 de 4
Ponencia
Complexity Classes in Cellular Computing with Membranes
(2003)
In this paper we introduce the complexity class PMC∗ F of all decision problems solvable in polynomial time by a family of P systems belonging to a prefixed class of recognizer membrane systems, F.
Capítulo de Libro
Computationally Hard Problems Addressed Through P Systems
(Springer, 2006)
In this chapter we present a general framework to provide efficient solutions to decision problems through families of cell-like membrane systems constructed in a semi-uniform way (associating with each instance of the ...
Capítulo de Libro
The P Versus NP Problem Through Cellular Computing with Membranes
(Springer, 2004)
We study the P versus NP problem through membrane systems. Language accepting P systems are introduced as a framework allowing us to obtain a characterization of the P = NP relation by the polynomial time unsolvability ...
Capítulo de Libro
Computing Partial Recursive Functions by Transition P Systems
(Springer, 2004)
In this paper a variant of transition P systems with external output designed to compute partial functions on natural numbers is presented. These P systems are stable under composition, iteration and unbounded minimization ...