MAX-3SAT
= MAX-3SAT
{wiki=MAX-3SAT}
MAX-3SAT is an optimization problem that is a specific case of the broader boolean satisfiability problem (SAT). In MAX-3SAT, given a boolean formula in conjunctive normal form (CNF), the goal is to determine the maximum number of clauses that can be satisfied by any assignment of truth values to the variables.