Related articles:
Maximum satisfiability problem
NP-complete
P versus NP problem
NP-hard
APX
Computational complexity theory
P-complete
Decision problem
Sharp-P
PSPACE-complete
Constraint satisfaction problem
Satisfiability Modulo Theories
Approximation algorithm
DPLL algorithm
Horn clause
Conjunctive normal form
Tautology (logic)
PP (complexity)
Model checking
Clique problem
Binary decision diagram
Stephen Cook
Key terms:
problem
sat
satisfiability
formula
variables
clause
assignments
solved
instances
solvers
algorithm
boolean
literals
np
satisfiability problem
complexity
verification
satisfying assignment
benchmarks
constraints
negation
vee
determining
each clause
propositional
boolean satisfiability problem
electronic design automation
propagation
computer science
normal form
lor
decision problem
checking
quantified
horn clause
chaff
eda
positive literal
local search
lnot
textstyle
exponential
conjunctive normal form
polynomial time
iff
Search external links cited by footnotes on Wikipedia page Boolean satisfiability problem:
|
|