Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:application |
gptkb:artificial_intelligence
operations research bioinformatics circuit design |
| gptkbp:category |
NP-hard problem
|
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:describes |
Given a Boolean formula in conjunctive normal form, the goal is to find an assignment that satisfies the maximum number of clauses.
|
| gptkbp:estimatedCost |
Yes
|
| gptkbp:field |
gptkb:logic
computer science theoretical computer science |
| gptkbp:fullName |
gptkb:Maximum_Satisfiability_Problem
|
| gptkbp:generalizes |
gptkb:SAT
|
| gptkbp:hasVariant |
gptkb:Partial_Max-SAT
gptkb:Weighted_Max-SAT |
| https://www.w3.org/2000/01/rdf-schema#label |
Max-SAT
|
| gptkbp:relatedTo |
mathematical optimization
Boolean satisfiability problem |
| gptkbp:solvedBy |
gptkb:SAT_solvers
approximation algorithms branch and bound local search algorithms |
| gptkbp:studiedBy |
1970s
|
| gptkbp:variant |
gptkb:SAT
|
| gptkbp:bfsParent |
gptkb:Boolean_satisfiability_problem
|
| gptkbp:bfsLayer |
6
|