k-SAT (for k ≥ 3, optimization version)
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
mathematical optimization |
| gptkbp:approximation |
has known approximation algorithms
|
| gptkbp:complexity |
APX-complete (for k ≥ 3)
|
| gptkbp:distinctFrom |
decision version of k-SAT
|
| gptkbp:goal |
maximize the number of satisfied clauses
|
| gptkbp:hasSpecialCase |
gptkb:MAX-SAT
|
| https://www.w3.org/2000/01/rdf-schema#label |
k-SAT (for k ≥ 3, optimization version)
|
| gptkbp:input |
Boolean formula in conjunctive normal form with k literals per clause
|
| gptkbp:notableFor |
greedy algorithms
randomized approximation algorithms |
| gptkbp:NP-hardness |
gptkb:NP-hard
|
| gptkbp:output |
assignment of variables maximizing satisfied clauses
|
| gptkbp:relatedTo |
gptkb:k-SAT
gptkb:MAX-3SAT Boolean satisfiability problem MAX-2SAT |
| gptkbp:studiedBy |
1970s
|
| gptkbp:usedIn |
gptkb:complexity_theory
theoretical computer science algorithm design |
| gptkbp:bfsParent |
gptkb:NP-hard_problems
|
| gptkbp:bfsLayer |
7
|