NDC TechTown and CppCon trip report
I just got home from the second conference I gave a talk at during September and decided to write about my experiences while I am slowly decompressing.
I just got home from the second conference I gave a talk at during September and decided to write about my experiences while I am slowly decompressing.
In the previous two parts we used a SAT solver as a black box that we feed input into, and it will (usually quickly) spit out an answer. In this part, we will look at how SAT solvers work and what heuristics and other tricks they employ in their quest for performance.
I am planning to create a branch for the next major version of Catch2 soon, and doing so brings some questions about Catch2's future.
I just spent a week investigating the use of YubiKey and GPG (Gnu Privacy Guard) in our company for security purposes. During that week I've read many tutorials on GPG, some obsolete, some not, and had to piece how to get GPG + YubiKey working from WSL. Then I wrote everything down in this post.
The previous post in this series was a quick introduction to the world of SAT and SAT solvers. In this post, we will convert a harder real-world problem, namely _master-key system_, into SAT and explore some of the more advanced techniques used to efficiently convert problems to SAT.