====== Advanced algorithms - Spring 2009 ======


| 19-02 | Turing machines  | {{:en:courses:2008-2009:aa-e1.pdf|Exercices}} | {{:en:courses:2008-2009:aa-s1.pdf|Solutions}} |
| 26-02 | NP-completeness | {{:en:courses:2008-2009:aa-e2.pdf|Exercices}} | {{:en:courses:2008-2009:aa-s2.pdf|Solutions}} |
| 05-03 | Reduction  |||
| 12-03 | Approximation algorithms | {{:en:courses:2008-2009:aa-e3.pdf|Exercices}} | {{:en:courses:2008-2009:aa-s3.pdf|Solutions}} |
| 19-03 | Approximation algorithms |||
| 26-03 | Approximation algorithms | {{:en:courses:2008-2009:aa-e4.pdf|Exercices}} ||
| 02-04 | Linear programming | {{:en:courses:2008-2009:aa-e5.pdf|Exercices}} | {{:en:courses:2008-2009:aa-s5.pdf|Solutions}} |
| 09-04 | Primal-Dual schemes | {{:en:courses:2008-2009:aa-e6.pdf|Exercices}} |{{:en:courses:2008-2009:aa-s6.pdf|Solutions}} |
| 23-04 | Primal-Dual schemes |||
| 30-04 | Semidefinite programming | {{:en:courses:2008-2009:aa-e7.pdf|Exercices}} |{{:en:courses:2008-2009:aa-s7.pdf|Solutions}} |
| 07-05 | Chernoff bound | {{:en:courses:2008-2009:aa-e8.pdf|Exercices}} |{{:en:courses:2008-2009:aa-s8.pdf|Solutions}} |
| 14-05 | Balls and Bins | {{:en:courses:2008-2009:aa-e9.pdf|Exercices}} |{{:en:courses:2008-2009:aa-s9.pdf|Solutions}} |
| 28-05 | Various | {{:en:courses:2008-2009:aa-e10.pdf|Exercices}} |{{:en:courses:2008-2009:aa-s10.pdf|Solutions}} |