Let CNF H1 = {| is a satisfiable cnf-formula where each clause contains any number of

Question:

Let CNFH1 = {〈ϕ〉| ϕ is a satisfiable cnf-formula where each clause contains any number of positive literals and at most one negated literal. Furthermore, each negated literal has at most one occurrence in ϕ}. Show that CNFH1 is NLϕ complete.

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

Step by Step Answer:

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