Related articles:
Computational complexity theory
NP-complete
Tautology (logic)
Key terms:
acm
algorithm
assignments
benchmarks
boolean
boolean satisfiability problem
chaff
checking
clause
clause is limited
complexity
computer science
constraints
decision problem
determining the satisfiability
eda
electronic design automation
formula
formula in which each clause
formula true
horn
ieee transactions
if we allow
instances
literals
lnot
lor
negation
normal form
np
per clause
positive literal
problem
problem is called
proc
propagation
propositional
propositional satisfiability
runtime behavior
sat solvers
satisfiability
satisfiability of a formula
satisfiability problem
satisfying assignments
solved
textstyle
variable assignments
variables
vee
verification
Search external links cited by footnotes on Wikipedia page Boolean satisfiability problem:
|
|