Complexity classes in models of cellular computing with membranes

  • Authors:
  • Mario J. Péerez Jiménez;álvaro Romero Jiménez;Fernando Sancho Caparrini

  • Affiliations:
  • Dpto. de Ciencias de la Computación e Inteligencia Artificial, E.T.S. Ingeniería Informática, Universidad de Sevilla, Sevilla, Spain (E-mail: Mario.Perez@cs.us.es);Dpto. de Ciencias de la Computación e Inteligencia Artificial, E.T.S. Ingeniería Informática, Universidad de Sevilla, Sevilla, Spain (E-mail: Alvaro.Romero@cs.us.es ...;Dpto. de Ciencias de la Computación e Inteligencia Artificial, E.T.S. Ingeniería Informática, Universidad de Sevilla, Sevilla, Spain (E-mail: Fernando.Sancho@cs.us.es

  • Venue:
  • Natural Computing: an international journal
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we introduce four complexity classes for cellularcomputing systems with membranes: the first and the second ones containall decision problems solvable in polynomial time by a family ofdeterministic P systems, without and with an input membrane,respectively; the third and fourth classes contain all decision problemssolvable in polynomial time by a family of non-deterministic P systems,without and with an input membrane, respectively. We illustrate theusefulness of these classes by solving two NP–completeproblems, namely HPP and SAT, in both variants of Psystems.