SAT solving is a "brute force method"?! I do not agree.https://twitter.com/vincentzimmer/status/892642327109394434 …
-
-
This Tweet is unavailable.
-
Replying to @laurilove
The important bit here is "in general". Most actual SAT instances can be solved much more efficiently. An that's what SAT solvers exploit.
2 replies 0 retweets 0 likes -
Replying to @oe1cxw @laurilove
Nobody would be using SAT solvers if they were just brute force guessing solutions and checking if they found one that works..
1 reply 1 retweet 4 likes -
Replying to @oe1cxw @laurilove
If you have continuous better-than-exponential improvements in algorithmic performance for decades then >> https://pbs.twimg.com/media/C_Z2-GfXsAAGBwW.jpg …
2 replies 0 retweets 0 likes -
This Tweet is unavailable.
-
Replying to @laurilove
Better-than-exponential. graph already is on a log scale. :) I don't know if there's a name and I don't have actual data for that claim..
2 replies 0 retweets 0 likes -
Replying to @oe1cxw @laurilove
I should ask the cprover people what the data for that graph is since I'm using it whenever I talk to ppl about progress in SAT solving..
2 replies 0 retweets 0 likes
But re the latest data point for mid 2010s: 1,000,000 variables in a SAT problem is actually pretty modest right now imo. :)
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.