Question: Suppose an oracle has given you a magic computer, C, that when given any Boolean formula B in CNF will tell you in one step
Suppose an oracle has given you a magic computer, C, that when given any Boolean formula B in CNF will tell you in one step whether B is satisfiable. Show how to use C to construct an actual assignment of satisfying Boolean values to the variables in any satisfiable formula B. How many calls do you need to make to C in the worst case in order to do this?
Step by Step Solution
3.29 Rating (149 Votes )
There are 3 Steps involved in it
Number the variables in a satisfiable formula B as x 1 ... View full answer
Get step-by-step solutions from verified subject matter experts
