This preview shows page 1. Sign up to view the full content.
Unformatted text preview: NP . We reduce 3 SAT to 0 1 integer programming. Suppose we have m clauses (with three literals each) over variables u 1 , , u n . or each clause, construct an inequality by replacing with +, u i with x i , and u i by 1 x i , and requiring the sum to be at least 1. This gives m inequalities over n variables x 1 , , x n . or example, the clause u 2 u 4 u 5 becomes x 2 + 1 x 4 + x 5 1, with x i { , 1 } For each i . Clearly the original set oF clauses is satisfable iF and only iF the set oF m inequalities constructed has a solution. 1...
View
Full
Document
 Spring '09
 ALEX
 Algorithms, C Programming

Click to edit the document details