4.7 Article

A Protocol for Solutions to DP-Complete Problems through Tissue Membrane Systems

Journal

MATHEMATICS
Volume 11, Issue 13, Pages -

Publisher

MDPI
DOI: 10.3390/math11132797

Keywords

complexity class; DP; membrane computing; tissue P systems

Categories

Ask authors/readers for more resources

This paper discusses the class R of recognizer membrane systems that can provide polynomial-time and uniform solutions for NP-complete problems, defining it as an efficient class. By representing R as a class of efficient recognizer cell-like P systems with object evolution rules, communication rules, and dissolution rules, the polynomial-time complexity class PMCR is obtained, encompassing both the NP and co-NP classes. The DP class, which includes languages that can be expressed as the difference between any two languages in NP, is considered as a more complex class than the NP class and serves as promising candidates for studying the P vs NP problem. This paper extends previous results to include any class R of efficient recognizer tissue-like membrane systems and presents a detailed protocol for transforming solutions of NP-complete problems into solutions of DP-complete problems.
Considering a class R comprising recognizer membrane systems with the capability of providing polynomial-time and uniform solutions for NP-complete problems (referred to as a presumably efficient class), the corresponding polynomial-time complexity class PMCR encompasses both the NP and co - NP classes. Specifically, when R represents the class of recognizer presumably efficient cell-like P systems that incorporate object evolution rules, communication rules, and dissolution rules, PMCR includes both the DP and co - DP classes. Here, DP signifies the class of languages that can be expressed as the difference between any two languages in NP (it is worth noting that NP subset of DP and co - NP subset of co - DP). As DP-complete problems are believed to be more complex than NP-complete problems, they serve as promising candidates for studying the P vs NP problem. This outcome has previously been established within the realm of recognizer P systems with active membranes. In this paper, we extend this result to encompass any class R of presumably efficient recognizer tissue-like membrane systems by presenting a detailed protocol for transforming solutions of NP-complete problems into solutions of DP-complete problems.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available