{"version":"1.0","type":"link","title":"Maximum satisfiability problem - Newikis","description":"In computational complexity theory, the maximum satisfiability problem (MAX-SAT) is the problem of determining the maximum number of clauses, of a given Boolean formula in conjunctive normal form, that can be made true by an assignment of truth values to the variables of the formula. It is a…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}