Partial Satisfiability Problem
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:abbreviation |
gptkb:Partial_SAT
|
| gptkbp:application |
approximation algorithms
constraint satisfaction |
| gptkbp:complexity |
NP-complete
|
| gptkbp:defines |
Given a Boolean formula and an integer k, is there a truth assignment that satisfies at least k clauses?
|
| gptkbp:field |
theoretical computer science
|
| gptkbp:generalizes |
Boolean satisfiability problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Partial Satisfiability Problem
|
| gptkbp:introducedIn |
1990s
|
| gptkbp:relatedTo |
Boolean satisfiability problem
|
| gptkbp:bfsParent |
gptkb:Partial_SAT
|
| gptkbp:bfsLayer |
7
|