Skip to main content
SpringerLink
Log in

Complexity classes in models of cellular computing with membranes

  • Published:
Natural Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Păun G (2000) Computing with membranes. Journal of Computer and System Sciences 61(1): 108–143

    Google Scholar 

  • Păun G (2002) Membrane Computing. An Introduction. Springer-Verlag, Berlin

    Google Scholar 

  • Pérez Jiménez MJ, Romero Jiménez A and Sancho Caparrini F (2002) Teoría de la complejidad en modelos de computaciôn celular con membranas. Editorial Kronos, Sevilla

    Google Scholar 

  • Pérez Jiménez MJ, Romero Jiménez Á and Sancho Caparrini F (2003) Decision P systems and the P ≠ NP conjecture. In: Păun G, Rozenberg G, Salomaa A and Zandron C (eds) Membrane Computing (International Workshop, WMC-CdeA 2002, Curtea de Arges, Romania, 19-23 August 2002, Revised Papers), pp. 388–399. LNCS 2597, Springer-Verlag

  • Pérez Jiménez MJ, Romero Jiménez A and Sancho Caparrini F (2003) Solving the VALIDITY problem by active membranes with input. In: Cavalieri M, Martín-Vide C and Păun G (eds) Proceedings of the Brainstorming Week on Membrane Computing, pp. 279–290. GRLM Report 26/03, Rovira i Virgili Unoversity of Tarragona

  • Romero Jiménez A (2003) Complejidad y Universalidad en Modelos de Computaciôn Celular. Ph.D. thesis, Universidad de Sevilla.

Download references

Author information

Authors and Affiliations

  1. Dpto. de Ciencias de la Computación e Inteligencia Artificial, E.T.S. Ingeniería Informática, Universidad de Sevilla, Sevilla, Spain

    Mario J. Péerez Jiménez, Álvaro Romero Jiménez & Fernando Sancho Caparrini

Authors
  1. Mario J. Péerez Jiménez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Álvaro Romero Jiménez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fernando Sancho Caparrini
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jiménez, M.J.P., Jiménez, Á.R. & Caparrini, F.S. Complexity classes in models of cellular computing with membranes. Natural Computing 2, 265–285 (2003). https://doi.org/10.1023/A:1025449224520

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1025449224520

Search

Navigation