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