INF339 is on advanced topics in algorithms and complexity. The content of the
course is changing from semester to semester. This semester we study
algorithms for Satisfiability problem. In particular, we discuss
- Place of the SAT( k-SAT) problem in the Theory of
Algorithms.
- k-SAT and graph theoretic problems.
- Davis-Putnam algorithm.
- Backtracking.
- Local search.
- SAT solvers, decision heuristics.
This semester INF339 has many topics in common with INF349, and we plan a
number of joint seminars.