Length: 10 hours - 2 cfu
Abstract
The course aims at presenting the theoretical foundations of dynamic programming, illustrating some techniques to design dynamic programming algorithms of polynomial and pseudo-polynomial complexity and showing some application examples. Some techniques to make dynamic programming more efficient will be illustrated: for instance, bi-directional dynamic programming and completion bounds
.
Dates & Venue
| Giorni | Aula | Orario |
| 24/01/2023 | Lab. Laurea Magistrale 3° floor - Via Celoria 18 - 20133 Milan |
10:30-13:00 |
| 31/01/2023 | .Lab. Laurea Magistrale 3° floor - Via Celoria 18 - 20133 Milan |
10:30-13:00 |
| 07/02/2023 | Lab. Laurea Magistrale 3° floor - Via Celoria 18 - 20133 Milan | 10:30-13:00 |
| 01/03/2023 | Lab. Laurea Magistrale 3° floor - Via Celoria 18 - 20133 Milan |
10:00-12:30 |
Suggested Readings
Course for doctoral students in computer science, mathematics or other STEM disciplines.