After successful completion of the course, students are able to...
In this seminar, we discuss algorithmic graph theory and the use of its methods for the problems in the field of boolean satisfiability (SAT and QSAT). We focus on the design and implementation of parameterized algorithms in this area. In particular, the goal is to employ tree decompositions in such a way that existing SAT-solvers can be integrated in the corresponding algorithm.
Design, implementation, and presentation of a parameterized algorithm.
ECTS Breakdown:
Assessement is based on the implementation and the oral presenation.
Not necessary