2400077 – Theory of Satisfiability Algorithms

The Satisfiability (SAT) problem for Boolean formulas is fundamental for computer science, due to a variety of applications (cf. the practical success of SAT solvers) as well as its central role for the theory of computation. This course focuses on theoretical aspects of the problem.