Skip to main content
SpringerLink
Log in

The P Versus NP Problem Through Cellular Computing with Membranes

  • Chapter
Aspects of Molecular Computing

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2950))

Abstract

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 of an NP–complete problem by means of a P system.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berry, G., Boudol, G.: The chemical abstract machine. Theoretical Computer Science 96, 217–248 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cook, S.: The P versus NP problem. Manuscript prepared for the Clay Mathematics Institute for the Millennium Prize Problems (revised November 2000)

    Google Scholar 

  3. Manca, V.: String rewriting and metabolism: A logical perspective. In: Păun, G. (ed.) Computing with Bio-Molecules. Theory and Experiments, pp. 36–60. Springer, Singapore (1998)

    Google Scholar 

  4. Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)

    MATH  Google Scholar 

  5. Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000); Turku Center for Computer Science-TUCS Report Nr. 208 (1998)

    Google Scholar 

  6. P˘aun, G., Rozenberg, G.: A guide to membrane computing. Theoretical Computer Science 287, 73–100 (2002)

    Article  MathSciNet  Google Scholar 

  7. Pérez–Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Teoría de la Complejidad en Modelos de Computación con Membranas. In: Kronos, Sevilla, eds. (2002)

    Google Scholar 

  8. Romero-Jiménez, A.: Complexity and Universality in Cellular Computing Models, PhD. Thesis. University of Seville, Spain (2003)

    Google Scholar 

  9. Romero-Jiménez, A., Pérez Jiménez, M.J.: Simulating Turing machines by P systems with external output. Fundamenta Informaticae 49(1-3), 273–287 (2002)

    MATH  MathSciNet  Google Scholar 

  10. Turing, A.: On computable numbers with an application to the Entscheidnungsproblem. Proceeding London Mathematical Society, serie 2(42), 230–265 (1936-1937)

    Google Scholar 

  11. Zandron, C., Ferreti, C., Mauri, G.: Solving NP-complete problems using P systems with active membranes. In: Antoniou, I., Calude, C., Dinneen, M.J. (eds.) Unconventional Models of Computation, UMC 2000, pp. 289–301. Springer, Berlin (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpt. Computer Science and Artificial Intelligence, E.T.S. Ingeniería Informática, University of Seville, Avda. Reina Mercedes s/n, 41012, Sevilla, Spain

    Mario J. Pérez-Jiménez, Alvaro Romero-Jiménez & Fernando Sancho-Caparrini

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

    You can also search for this author in PubMed Google Scholar

  2. Alvaro 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

Editor information

Editors and Affiliations

  1. University of South Florida, 4202 E. Fowler Ave, 33620, Tampa, Fl, USA

    Nataša Jonoska

  2. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, Bucureşti, Romania

    Gheorghe Păun

  3. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F. (2003). The P Versus NP Problem Through Cellular Computing with Membranes. In: Jonoska, N., Păun, G., Rozenberg, G. (eds) Aspects of Molecular Computing. Lecture Notes in Computer Science, vol 2950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24635-0_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24635-0_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20781-8

  • Online ISBN: 978-3-540-24635-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation