how can we show that MAX SAT (: Given a CNF formula and an integer g, find a truth assignment that satisfies at least g clauses.) , SPARSE SUBGRAPH (: Given a graph and two integers a and b, find a set of a vertices of G such that there are at most b edges between them.) can be reduced to 3SAT? do we need to come up with a function? how about MIN SAT(is it the opposite of MAX SAT?).
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
