We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
From NP-Completeness to DP-Completeness: A Membrane Computing Perspective.
- Authors
Valencia-Cabrera, Luis; Orellana-Martín, David; Martínez-del-Amor, Miguel Á.; Pérez-Hurtado, Ignacio; Pérez-Jiménez, Mario J.
- 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. P M C ℛ is closed under complement and under polynomial-time reduction. Therefore, if ℛ is a presumably efficient computing model of recognizer membrane systems, then N P ∪ co-NP ⊆ P M C ℛ . In this paper, the lower bound N P ∪ co-NP for the time complexity class P M C ℛ is improved for any presumably efficient computing model ℛ of recognizer membrane systems verifying some simple requirements. Specifically, it is shown that D P ∪ co-DP is a lower bound for such P M C ℛ , where DP is the class of differences of any two languages in NP. Since N P ∪ co-NP ⊆ D P ∩ co-DP, this lower bound for P M C ℛ delimits a thinner frontier than that with N P ∪ co-NP.
- Subjects
POLYNOMIAL time algorithms; STATISTICAL decision making; COMPUTATIONAL complexity; NP-complete problems; CLASS differences; PHOSPHORUS
- Publication
Complexity, 2020, p1
- ISSN
1076-2787
- Publication type
Article
- DOI
10.1155/2020/6765097