boolean satisfiability problem (optimization version)
GPTKB entity
Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:alsoKnownAs |
gptkb:MAX-SAT
|
| gptkbp:application |
gptkb:artificial_intelligence
operations research circuit design theorem proving |
| 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 |
computer science
theoretical computer science |
| gptkbp:generalizes |
gptkb:boolean_satisfiability_problem
|
| gptkbp:hasSpecialCase |
gptkb:MAX-3SAT
MAX-2SAT |
| https://www.w3.org/2000/01/rdf-schema#label |
boolean satisfiability problem (optimization version)
|
| gptkbp:isOptimizationVersionOf |
gptkb:SAT
|
| gptkbp:relatedTo |
gptkb:boolean_satisfiability_problem
|
| gptkbp:studiedBy |
1970s
|
| gptkbp:bfsParent |
gptkb:NP-hard_problems
|
| gptkbp:bfsLayer |
7
|