Question: 9. Imagine that there is a large Boolean formula (not necessarily in CNF) written on the white- board, where n is the nunber of connectives

 9. Imagine that there is a large Boolean formula (not necessarily

9. Imagine that there is a large Boolean formula (not necessarily in CNF) written on the white- board, where n is the nunber of connectives (AND's, OR's, and NOT's). Perhaps n = 200. You claim that the formula is satisfiable;I claim that it is not. (a) What do you have to do to convince me that you are right? How much time (in order notation) do you need (as a function of n)? Note: Only count the time needed to actually show me that you are right, not any time needed to figure out how to do so. (b) What do I have to do to convince you that I am right? How uch time (in order notation) do I need (as a function of n)? Note: Only count the time needed to actually show you that I am right, not any time needed to figure out how to do so

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock 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 Databases Questions!