Let CNFH = {| is a satisfiable cnf-formula where each clause contains any number of literals,

Question:

Let CNFH = {〈ϕ〉| ϕ is a satisfiable cnf-formula where each clause contains any number of literals, but at most one negated literal}. Show that CNFH ∈ P.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: