From NP-Completeness to DP-Completeness: A Membrane Computing Perspective
Joint Authors
Valencia-Cabrera, Luis
Pérez-Jiménez, Mario J.
Orellana-Martín, David
Martínez-del-Amor, Miguel Á.
Pérez-Hurtado, Ignacio
Source
Issue
Vol. 2020, Issue 2020 (31 Dec. 2020), pp.1-10, 10 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2020-08-30
Country of Publication
Egypt
No. of Pages
10
Main Subjects
Abstract EN
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.
PMCℛ is closed under complement and under polynomial-time reduction.
Therefore, if ℛ is a presumably efficient computing model of recognizer membrane systems, then NP ∪ co-NP ⊆ PMCℛ.
In this paper, the lower bound NP ∪ co-NP for the time complexity class PMCℛ is improved for any presumably efficient computing model ℛ of recognizer membrane systems verifying some simple requirements.
Specifically, it is shown that DP ∪ co-DP is a lower bound for such PMCℛ, where DP is the class of differences of any two languages in NP.
Since NP ∪ co-NP ⊆ DP ∩ co-DP, this lower bound for PMCℛ delimits a thinner frontier than that with NP ∪ co-NP.
American Psychological Association (APA)
Valencia-Cabrera, Luis& Orellana-Martín, David& Martínez-del-Amor, Miguel Á.& Pérez-Hurtado, Ignacio& Pérez-Jiménez, Mario J.. 2020. From NP-Completeness to DP-Completeness: A Membrane Computing Perspective. Complexity،Vol. 2020, no. 2020, pp.1-10.
https://search.emarefa.net/detail/BIM-1143343
Modern Language Association (MLA)
Valencia-Cabrera, Luis…[et al.]. From NP-Completeness to DP-Completeness: A Membrane Computing Perspective. Complexity No. 2020 (2020), pp.1-10.
https://search.emarefa.net/detail/BIM-1143343
American Medical Association (AMA)
Valencia-Cabrera, Luis& Orellana-Martín, David& Martínez-del-Amor, Miguel Á.& Pérez-Hurtado, Ignacio& Pérez-Jiménez, Mario J.. From NP-Completeness to DP-Completeness: A Membrane Computing Perspective. Complexity. 2020. Vol. 2020, no. 2020, pp.1-10.
https://search.emarefa.net/detail/BIM-1143343
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1143343