Browsing Artículos (Ciencias de la Computación e Inteligencia Artificial) by Subject 

Browsing Artículos (Ciencias de la Computación e Inteligencia Artificial) by Subject "Complexity class DP"

Now showing items 1-2 of 2

    • Article
      Icon

      From SAT to SAT-UNSAT using P systems with dissolution rules 

      Riscos Núñez, Agustín; Valencia Cabrera, Luis (Springer, 2022)
      DP is the class of problems that are the differences between two languages from NP. Most difficult problems from DP are ...
    • Article
      Icon

      The Unique Satisfiability Problem from a Membrane Computing Perspective 

      Orellana Martín, David; Valencia Cabrera, Luis; Riscos Núñez, Agustín; Pérez Jiménez, Mario de Jesús (Romanian Academy, Section for Information Science and Technology, 2018)
      Complexity class DP is the class of “differences” of any two languages in NP. It verifies that NP[ co-NP DP PNP, where ...