|
1. Description
This example is similar to 2-SAT example, except that the predicate used in this example is a 3-SAT with 4 variables and 6 clauses.
It should be pointed out that the ideas behind the two examples are the same. Although 2-SAT problems can actually be solved in polynomial time and are not truly NP-complete problem, the method presented in the 2-SAT example does not take advantage of it. To show that this method is equally applicable to general SAT problems, we choose a 3-SAT predicate in this example and solve it using the idea of 2-SAT example.
2. Download
next example
|
