Recent Advances in Combinatorial Solvers
The last decade has witnessed a small revolution in the field of solvers for hard combinatorial problems. The guiding problem has been SAT, which has pushed to boundaries of solvable problems for a few orders of magnitudes and modern SAT solvers can achieve truly remarkable performance. However, solvers for other problems have seen big breakthroughs, e.g., solvers for the clique problem, subgraph isomorphism problem, vertex cover, and graph isomorphism problem. In this course, the students will investigate and empirically evaluate these advances on real-life problems. Restrictions/Prerequisites: Basic knowledge of graph theory, combinatorial algorithms, computational complexity.
