IDEAS home Printed from https://ideas.repec.org/a/hin/complx/6765097.html
   My bibliography  Save this article

From NP-Completeness to DP-Completeness: A Membrane Computing Perspective

Author

Listed:
  • Luis Valencia-Cabrera
  • David Orellana-Martín
  • Miguel Á. Martínez-del-Amor
  • Ignacio Pérez-Hurtado
  • Mario J. Pérez-Jiménez

Abstract

Presumably efficient computing models are characterized by their capability to provide polynomial-time solutions for NP -complete problems. Given a class of recognizer membrane systems, denotes the set of decision problems solvable by families from in polynomial time and in a uniform way. is closed under complement and under polynomial-time reduction. Therefore, if is a presumably efficient computing model of recognizer membrane systems, then     co - NP     . In this paper, the lower bound     co - NP for the time complexity class is improved for any presumably efficient computing model of recognizer membrane systems verifying some simple requirements. Specifically, it is shown that     co - DP is a lower bound for such , where DP is the class of differences of any two languages in NP . Since     co - NP         co - DP , this lower bound for delimits a thinner frontier than that with     co - NP .

Suggested Citation

  • Luis Valencia-Cabrera & David Orellana-Martín & Miguel Á. Martínez-del-Amor & Ignacio Pérez-Hurtado & Mario J. Pérez-Jiménez, 2020. "From NP-Completeness to DP-Completeness: A Membrane Computing Perspective," Complexity, Hindawi, vol. 2020, pages 1-10, August.
    • Handle: RePEc:hin:complx:6765097
    DOI: 10.1155/2020/6765097
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/6765097.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2020/6765097.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2020/6765097?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:6765097. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.