Announcement

Collapse
No announcement yet.

The Maximum satisfiability problem

Collapse
X
 
  • Filter
  • Time
  • Show
Clear All
new posts

  • The Maximum satisfiability problem

    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 generalization of the Boolean satisfiability problem, which asks whether there exists a truth assignment that makes all clauses true.

    Link: https://en.wikipedia.org/wiki/Maximu...bility_problem
Working...
X