Natural Computing

, Volume 2, Issue 3, pp 265–285

Complexity classes in models of cellular computing with membranes

  • Mario J. Péerez Jiménez
  • Álvaro Romero Jiménez
  • Fernando Sancho Caparrini
Article

DOI: 10.1023/A:1025449224520

Cite this article as:
Jiménez, M.J.P., Jiménez, Á.R. & Caparrini, F.S. Natural Computing (2003) 2: 265. doi:10.1023/A:1025449224520

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.

complexity classes membrane computing P systems 

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Mario J. Péerez Jiménez
    • 1
  • Álvaro Romero Jiménez
    • 1
  • Fernando Sancho Caparrini
    • 1
  1. 1.Dpto. de Ciencias de la Computación e Inteligencia Artificial, E.T.S. Ingeniería InformáticaUniversidad de SevillaSevillaSpain

Personalised recommendations