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

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

Complexity, 2020, vol. 2020, 1-10

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 .

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/6765097.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/6765097.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:6765097

DOI: 10.1155/2020/6765097

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().