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

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

[1]  Mario J. Pérez-Jiménez,et al.  Cell-like P systems with polarizations and minimal rules , 2020, Theor. Comput. Sci..

[2]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Mario de Jesús Pérez Jiménez,et al.  Membrane fission versus cell division: When membrane proliferation is not enough , 2015 .

[5]  Mario J. Pérez-Jiménez,et al.  On the Power of Dissolution in P Systems with Active Membranes , 2005, Workshop on Membrane Computing.

[6]  Gerd Wechsung,et al.  On the Boolean closure of NP , 1985, FCT.

[7]  Mario J. Pérez-Jiménez,et al.  Membrane fission versus cell division: When membrane proliferation is not enough , 2015, Theor. Comput. Sci..

[8]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[9]  John L. Casti,et al.  Unconventional Models of Computation , 2002, Lecture Notes in Computer Science.

[10]  Mario J. Pérez-Jiménez,et al.  Cell-like P systems with evolutional symport/antiport rules and membrane creation , 2020, Inf. Comput..

[11]  Mario J. Pérez-Jiménez,et al.  Decision P Systems and the P!=NP Conjecture , 2002, WMC-CdeA.

[12]  Mihalis Yannakakis,et al.  The complexity of facets (and some facets of complexity) , 1982, STOC '82.

[13]  Agustín Riscos-Núñez,et al.  Membrane Creation in Polarizationless P Systems with Active Membranes , 2020, Fundam. Informaticae.

[14]  Mario J. Pérez-Jiménez,et al.  Complexity classes in models of cellular computing with membranes , 2003, Natural Computing.

[15]  Juris Hartmanis,et al.  The Boolean Hierarchy I: Structural Properties , 1988, SIAM J. Comput..