|
gptkbp:instanceOf
|
theoretical computer science
Boolean satisfiability problem
|
|
gptkbp:clauseLength
|
3
|
|
gptkbp:definedIn
|
theory of computational complexity
|
|
gptkbp:estimatedCost
|
no
|
|
gptkbp:firstProvedNPCompleteBy
|
gptkb:Richard_Karp
|
|
gptkbp:formulaType
|
gptkb:conjunctive_normal_form
|
|
gptkbp:harderThan
|
2-SAT problem
|
|
gptkbp:hasSpecialCase
|
k-SAT problem
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
3-SAT problem
|
|
gptkbp:input
|
Boolean formula in conjunctive normal form with three literals per clause
|
|
gptkbp:isCanonicalNPCompleteProblem
|
true
|
|
gptkbp:minimumNumberOfVariables
|
3
|
|
gptkbp:NP-complete
|
true
|
|
gptkbp:output
|
true or false
satisfiable or unsatisfiable
|
|
gptkbp:reduces
|
general SAT problem
|
|
gptkbp:relatedTo
|
gptkb:P_vs_NP_problem
|
|
gptkbp:solvableInPolynomialTime
|
false
|
|
gptkbp:usedFor
|
benchmarking SAT solvers
|
|
gptkbp:usedIn
|
gptkb:artificial_intelligence
cryptography
theoretical computer science
algorithm design
theory of computational complexity
|
|
gptkbp:yearNPCompletenessProved
|
1972
|
|
gptkbp:bfsParent
|
gptkb:Exponential_Time_Hypothesis
|
|
gptkbp:bfsLayer
|
7
|