Boolean satisfiability problem (optimization version)
GPTKB entity
Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:alsoKnownAs |
gptkb:MAX-SAT
|
| gptkbp:application |
gptkb:artificial_intelligence
operations research circuit design |
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:defines |
Given a Boolean formula in conjunctive normal form, find an assignment that satisfies the maximum number of clauses.
|
| gptkbp:field |
gptkb:logic
computer science theoretical computer science |
| gptkbp:generalizes |
Boolean satisfiability problem
|
| gptkbp:hasVariant |
partial MAX-SAT
weighted MAX-SAT |
| https://www.w3.org/2000/01/rdf-schema#label |
Boolean satisfiability problem (optimization version)
|
| gptkbp:relatedTo |
Boolean satisfiability problem
|
| gptkbp:solvedBy |
approximation algorithms
local search algorithms branch and bound algorithms |
| gptkbp:studiedBy |
1970s
|
| gptkbp:bfsParent |
gptkb:NP-hard
|
| gptkbp:bfsLayer |
6
|