|
gptkbp:instanceOf
|
gptkb:theoretical_computer_science
gptkb:mathematical_optimization
|
|
gptkbp:approximationRatio
|
7/8 for general MAX-SAT
|
|
gptkbp:complexity
|
APX-complete
|
|
gptkbp:estimatedCost
|
yes
|
|
gptkbp:firstDescribed
|
1970s
|
|
gptkbp:generalizes
|
gptkb:SAT
|
|
gptkbp:hasExactAlgorithm
|
yes
|
|
gptkbp:hasHeuristic
|
yes
|
|
gptkbp:hasVariant
|
partial MAX-SAT
weighted MAX-SAT
|
|
gptkbp:input
|
Boolean formula in conjunctive normal form
|
|
gptkbp:NP-hardness
|
gptkb:NP-hard
|
|
gptkbp:output
|
maximum number of satisfiable clauses
|
|
gptkbp:relatedTo
|
gptkb:3-SAT
gptkb:Boolean_satisfiability_problem
gptkb:k-SAT
|
|
gptkbp:solvedBy
|
semidefinite programming
greedy algorithms
branch and bound
local search algorithms
|
|
gptkbp:usedIn
|
gptkb:theoretical_computer_science
gptkb:artificial_intelligence
operations research
|
|
gptkbp:bfsParent
|
gptkb:Satisfiability_(SAT)
gptkb:MAX-3SAT
gptkb:Boolean_satisfiability_problem_(SAT)
gptkb:Boolean_satisfiability_problem_(optimization_version)
|
|
gptkbp:bfsLayer
|
7
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
MAX-SAT
|