Statements (30)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
mathematical optimization |
| gptkbp:approximationRatio |
7/8 for general MAX-SAT
|
| gptkbp:complexity |
APX-complete
|
| gptkbp:estimatedCost |
yes
|
| gptkbp:firstDescribed |
1970s
|
| gptkbp:generalizes |
gptkb:SAT
|
| gptkbp:hasExactAlgorithm |
yes
|
| gptkbp:hasHeuristic |
yes
|
| gptkbp:hasVariant |
partial MAX-SAT
weighted MAX-SAT |
| https://www.w3.org/2000/01/rdf-schema#label |
MAX-SAT
|
| gptkbp:input |
Boolean formula in conjunctive normal form
|
| gptkbp:NP-hardness |
gptkb:NP-hard
|
| gptkbp:output |
maximum number of satisfiable clauses
|
| gptkbp:relatedTo |
gptkb:3-SAT
gptkb:k-SAT Boolean satisfiability problem |
| gptkbp:solvedBy |
semidefinite programming
greedy algorithms branch and bound local search algorithms |
| gptkbp:usedIn |
gptkb:artificial_intelligence
operations research theoretical computer science |
| gptkbp:bfsParent |
gptkb:Satisfiability_(SAT)
gptkb:MAX-3SAT gptkb:Boolean_satisfiability_problem_(SAT) gptkb:Boolean_satisfiability_problem_(optimization_version) |
| gptkbp:bfsLayer |
7
|