https://act.iti.kit.edu/ 2026-04-10T17:29:41+00:00 https://act.iti.kit.edu/ https://act.iti.kit.edu/_media/wiki/dokuwiki.svg text/html 2026-04-09T15:10:14+00:00 Anonymous (anonymous@undisclosed.example.com) https://act.iti.kit.edu/teaching/26sose/theoryofsat?rev=1775747414&do=diff Theory of Satisfiability Algorithms General Lecturer: Marvin Künnemann Lecture Dates (21.04. to 28.07.): * Tuesday, 14:00 - 15:30, InformatiKOM II -- 50.28 Seminarraum 1 Course Contents 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, which includes topics…