Skip to main content

Decision P Systems and the P≠NP Conjecture

  • Conference paper
  • First Online:
Book cover Membrane Computing (WMC 2002)

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

Included in the following conference series:

Abstract

We introduce decision P systems,which are a class of P systems with symbol-objects and external output. The main result of the paper is the following:if there exists an NP-complete problem that cannot be solved in polynomial time,with respect to the input length,by a deterministic decision P system constructed in polynomial time,then PNP. From Zandron-Ferreti-Mauri’s theorem it follows that if PNP,then no NP-complete problem can be solved in polynomial time, with respect to the input length,by a deterministic P system with active membranes but without membrane division,constructed in polynomial time from the input. Together,these results give a characterization of PNP in terms of deterministic P systems.

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

Access this chapter

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. Păun, G.: Membrane Computing.An Introduction, Springer-Verlag, Berlin, 2002.

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Păun, G.; Rozenberg, G.: A Guide to Membrane Computing, Theoretical Computer Sciences, 287, 2002, 73–100.

    Article  MATH  Google Scholar 

  4. Păun, G.; Rozenberg, G.; Salomaa, A.: Membrane Computing with External Output, Fundamenta Informaticae,41(3), 2000, 313–340.

    MathSciNet  MATH  Google Scholar 

  5. Pérez Jiménez, M.J.; Romero-Jiménez, A.; Sancho Caparrini, F.: Teoría de la Complejidad en modelos de computación celular con membranas, Editorial Kronos, Sevilla, 2002.

    Google Scholar 

  6. Romero-Jiménez, A.; Pérez-Jiménez, M.J.: Simulating Turing Machines by P Systems with External Output, Fundamenta Informaticae, 49(1–3), 2002, 273–287.

    MathSciNet  MATH  Google Scholar 

  7. Zandron, C.; Ferretti, C.; Mauri, G.: Solving NP-Complete Problems Using P Systems with Active Membranes,in Unconventional Models of Computation (I. Antoniou, C.S. Calude, M.J. Dinneen,eds.), Springer-Verlag, London, 2000, 289–301.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pérez Jiménez, M.J., Romero Jiménez, Á., Sancho Caparrini, F. (2003). Decision P Systems and the P≠NP Conjecture. In: PĂun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. WMC 2002. Lecture Notes in Computer Science, vol 2597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36490-0_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-36490-0_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00611-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics