Seminár z algebraickej teórie grafov - Ján Mazák (14.5.2021)
v piatok 14.5.2021 o 13:00 hod. online formou
Od: Martin Mačaj
Prednášajúci: Ján Mazák
Názov: Modern SAT solvers --- an efficient tool for solving combinatorial problems
Over the last 25 years, SAT solvers became one of the most efficient computational tools for solving problems in discrete mathematics. We highlight major improvements in the algorithms for solving satisfiability of boolean formulas and point out the huge discrepancy between their theoretical complexity and efficiency in practice.
We show examples of problems where SAT solvers beat other computational tools (e.g. ILP solvers) and also discuss other problems where they are not very effective.
Due to recent restrictions imposed on us in response to the worsening of the situation with Covid infections in Slovakia, we will switch to distance mode. You will receive an MS Teams link over which you will be able to follow the presentation, ask questions, comment, and possibly even offer some solutions. While it is not better than being personally in the lecture room, it is not a terrible way to keep in touch either. Let us hope that we will soon be able to attend the meetings in person.