Abstract
In contrast to the extremal variants of coNP-complete problems, which are frequently DP-complete, many extremal variants of NP-complete problems are in P. We investigate the extremal variants of two NP-complete problems, the extremal colorability problem with restricted degree and the extremal unfrozen non-implicant problem, and show that both of them are DP-complete. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Cao, Y., Culberson, J., & Stewart, L. (2009). DP-complete problems derived from extremal NP-complete properties. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5734 LNCS, pp. 199–210). https://doi.org/10.1007/978-3-642-03816-7_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
