Applied Algorithmics and Complexity University of Bordeaux
The goal of this course is to give somewhat generic algorithmictechniques to deal with computational intractability (typically, NP-completeness) when one needs practical solutions. The focus is ontechniques with guaranteed performance: either exact algorithms, oralgorithms with a guaranteed approximation ratio.
Short written examination, practical work (writing software to solvesome NP-hard problem).
Examples of NP-hard and NP-complete problems. Examples ofpolynomial-time reductions. Exact solving techniques: exhaustivesearch, SAT-solvers, pseudo-polynomial algorithms. Optimizationproblems and approximation algorithms. Introduction to fixed-parameter tractability (FPT).
> Lectures and practical work: - 48 hours of face-to-face teaching. - 100 hours personal work.
Online Course Requirement
- Level B2 CEFR in English. - Previous studies (Bachelor level) within the domain of computerscience or similar. - Basic knowledge of algorithmic techniques and complexity theory.Duration: 12 weeksLanguage of instruction: EnglishMode of delivery: Face-to-face teaching: personal work
Site for Inquiry
Please inquire about the courses at the address below.
Contact person: Philippe Duchon firstname.lastname@example.org