MaxSAT
Given an instance of SAT represented in Conjunctive Normal Form (CNF), compute an assignment to the variables that maximizes the number of satisfied clauses.
Parameters
- : number of variables
Related Problems
- SAT2
Insufficient data to display graph
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Insuffient Data to display table
Reductions Table
Displaying 7 of 7 reductions
Other relevant algorithms
Insuffient Data to display table