SAT Solvers and Range Anxiety

In this presentation, Mate plans to talk about the base of all NP-complete problems, the satisfiability problem, how these problems are being solved with state-of-the-art SAT solvers, and how that is relevant to our everyday lives. SAT solvers have enjoyed a boom thanks to massive improvements through the use of lazy data structures, tricky graph algorithms, proof verification, and heuristics. This allowed SAT solvers to thrive in many different tasks such as hardware verification,software fuzzing, cryptography, and math proofs. In this talk we will examine some of the core data structures and algorithms used by SAT solvers, as well as show some example use-cases for them in different fields.