Buscar
Mostrando ítems 1-1 de 1
Artículo
From SAT to SAT-UNSAT using P systems with dissolution rules
(Springer, 2022)
DP is the class of problems that are the differences between two languages from NP. Most difficult problems from DP are called DP-complete problems, that can be seen as the conjunction of an NP-complete problem and a ...