
Modern SAT solvers
Modern SAT solvers
SAT is the problem of deciding whether a formula in boolean logic is satisfiable. What makes SAT interesting is that a variant of it was the first problem to be proven NPcomplete.
Appears in lists (1)
Modern SAT solvers
SAT is the problem of deciding whether a formula in boolean logic is satisfiable. What makes SAT interesting is that a variant of it was the first problem to be proven NPcomplete.