Given   : A 3 SAT problem.Known 1 : The SAT problem is satisfiable.Known 2 : We have a solution that satisfies the given 3 SAT.Problem Statement: Maximize the solution, i.e. find a solution such that it contains the maximum number of 1's amongst all possible valid solutions to the given problem.
Algorithm/Complexity for the following SAT Version
cc.complexity theory;ds.algorithms