Chapter 7: Q5E (page 322)
Is the following formula satisfiable?
Short Answer
This technique satisfiable since it uses every one of the variables that produce true and pair values based on X and Y.
Chapter 7: Q5E (page 322)
Is the following formula satisfiable?
This technique satisfiable since it uses every one of the variables that produce true and pair values based on X and Y.
All the tools & learning materials you need for study success - in one app.
Get started for freeYou are given a box and a collection of cards as indicated in the following figure. Because of the pegs in the box and the notches in the cards, each card will fit in the box in either of two ways. Each card contains two columns of holes, some of which may not be punched out. The puzzle is solved by placing all the cards in the box so as to completely cover the bottom of the box (i.e., every hole position is blocked by at least one card that has no hole there). It represents a card and this collection of cards has a solution}. Show that PUZZLE is NP-complete.
Call graphs isomorphic if the nodes of may be reordered so that it is identical to .
Let Show that .
Let Analyse the algorithm given on page 185 to show that this language is in .
Let has at least two satisfying assignments}. Show that complete
Let ? be a 3cnf-formula. An ≠-assignment to the variables of ? is one where each clause contains two literals with unequal truth values. In other words, an ≠ -assignment satisfies ? without assigning three true literals in any clause.
a. Show that the negation of any ≠ -assignment to ? is also an ≠ -assignment.
b. Let ≠ SAT be the collection of 3cnf-formulas that have an ≠ -assignment. Show that we obtain a polynomial time reduction from 3SAT to ≠ SAT by replacing each clause ci
$$
with the two clauses
Where is a new variable for each clause, and b is a single additional new variable.
c. Conclude that -complete.
What do you think about this solution?
We value your feedback to improve our textbook solutions.