Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
NP-hard problem |
| gptkbp:approximationAlgorithm |
random assignment achieves 7/8 ratio
|
| gptkbp:approximationRatio |
7/8
|
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:describes |
Given a 3-CNF Boolean formula, the goal is to find an assignment that satisfies the maximum number of clauses.
|
| gptkbp:field |
theoretical computer science
|
| gptkbp:generalizes |
gptkb:3SAT
|
| gptkbp:hardnessOfApproximation |
cannot be approximated within 7/8 + ε unless P=NP
|
| gptkbp:hasSpecialCase |
gptkb:MAX-SAT
|
| https://www.w3.org/2000/01/rdf-schema#label |
MAX-3SAT
|
| gptkbp:input |
3-CNF Boolean formula
|
| gptkbp:output |
assignment of variables
maximum number of satisfied clauses |
| gptkbp:relatedTo |
gptkb:3SAT
Boolean satisfiability problem |
| gptkbp:studiedBy |
1970s
|
| gptkbp:usedIn |
gptkb:complexity_theory
constraint satisfaction problems approximation algorithms research |
| gptkbp:bfsParent |
gptkb:3-SAT
|
| gptkbp:bfsLayer |
6
|