Question: Let CNF H1 = {| is a satisfiable cnf-formula where each clause contains any number of positive literals and at most one negated literal.

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.

Step by Step Solution

3.35 Rating (167 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Let CNF H1 is a satisfiable cnfformula where each ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Introduction theory computation Questions!