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

Valencia-Cabrera, L; Orellana-Martin, D; Martinez-del-Amor, MA; Perez-Hurtado, I; Perez-Jimenez, MJ

Orellana-Martin, D (corresponding author), Univ Seville, Dept Comp Sci & Artificial Intelligence, Res Grp Nat Comp, Avda Reina Mercedes S-N, E-41012 Seville, Spain.

COMPLEXITY, 2020; 2020 ():

Abstract

Presumably efficientcomputing models are characterized by their capability to provide polynomial-time solutions forNP-complete problems. Given a class......

Full Text Link