The important bit here is "in general". Most actual SAT instances can be solved much more efficiently. An that's what SAT solvers exploit.
SAT solving is a "brute force method"?! I do not agree.https://twitter.com/vincentzimmer/status/892642327109394434 …
-
-
This Tweet is unavailable.
-
- Show replies
-
-
-
I'd say it depends. "SAT solving" is not by itself a specific algorithm, and modern SAT solvers are definitely not using brute force algos.
-
On the other hand, you could obviously implement a SAT solver using brute force (enumerate and test valuations). Not that it's a good idea.
- Show replies
New conversation -
-
-
Yap. Brute force implies searching all possible assignments in all dimensions. Metahuersitic local search is not brute force.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.