Definitions from Wikipedia (Maximum satisfiability problem)

▸ noun:  In computational complexity theory, the maximum satisfiability problem 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.


▸ Words similar to maximum satisfiability problem
▸ Usage examples for maximum satisfiability problem

▸ Idioms related to maximum satisfiability problem
▸ Wikipedia articles (New!)
▸ Words that often appear near maximum satisfiability problem
▸ Rhymes of maximum satisfiability problem

▸ Invented words related to maximum satisfiability problem